Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 58920

Questions about properties of and problems on graphs, discrete data structures that have the form of nodes connected by edges, that is networks.

1
vote
Yes and yes. Look at this graph: $V=\{1,2,3,4\}$ $E=\{\{1,2\},\{2,3\},\{3,4\},\{4,1\}\}$ There is neither articulation point nor bridge. But if you delete any node/edge...
answered Jun 21 '17 by md5
2
votes
The diameter of the following graph is $2a+4$. If you start from $v$, you will need $i=2a+1$ iterations to have $s,t\in W_{i}$. It provides a family of counter-examples for an arbitrary large number o …
answered Dec 5 '17 by md5