Let G be a connected graph that is not a tree containing two distinct vertices u and v
Chapter 13, Problem 5(choose chapter or problem)
Let G be a connected graph that is not a tree containing two distinct vertices u and v such that G u and G v are both trees. Show that deg u = deg v.
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