It is known that if T is a nontrivial tree and v is a leaf of T , then T v is also a
Chapter 13, Problem 3(choose chapter or problem)
It is known that if T is a nontrivial tree and v is a leaf of T , then T v is also a tree. (a) Give an example of a connected graph G with _(G) = 2 such that G v is a tree for every vertex v of degree 2 in G. (b) Give an example of a connected graph G with _(G) = 3 such that G v is a tree for every vertex v of degree 3 in G. (c) Give an example of a connected graph G with _(G) = 4 containing at least one vertex of degree 3 such that G v is a tree for every vertex v of degree 3 in G.
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