Let G be a nontrivial connected graph of order n. Prove that G contains two vertices u
Chapter 13, Problem 21(choose chapter or problem)
Let G be a nontrivial connected graph of order n. Prove that G contains two vertices u and v with d(u, v) = n 1 if and only if G = Pn.
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