1,597 views

2 Answers

Best answer
4 votes
4 votes

The idea is to start off with a bridge or something and then build it up. Anyways this is the counter you need. You can delete either of the vertices that lie on the blue edge (bridge).

selected by
1 votes
1 votes
Assume K5 and K5 which are not connected ===> it is regular graph with degree 4 but not connected

Related questions

0 votes
0 votes
0 answers
1
Ayush Upadhyaya asked Jun 2, 2018
654 views
Prove that in a connected graph G a vertex v is a cut-vertex if and only if there exist two(or more) edges x and y incident on v such that no circuit in G includes both x...
1 votes
1 votes
1 answer
2
ankitgupta.1729 asked Apr 15, 2018
1,107 views
1 votes
1 votes
2 answers
3
0 votes
0 votes
0 answers
4
Ayush Upadhyaya asked Jun 8, 2018
478 views
Show that a simple graph is nonseparable iff for any two given arbitrary edges a circuit can always be found that will include these two edges.