Find a simple graph G with at least two nodes where both G
Chapter 6, Problem 70(choose chapter or problem)
Find a simple graph G with at least two nodes where both G and G are connected, thus showing that the converse of Exercise 69 is false.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer