A tree T has three vertices of degree 4 and five vertices of degree 6. The remaining
Chapter 13, Problem 16(choose chapter or problem)
A tree T has three vertices of degree 4 and five vertices of degree 6. The remaining vertices of T have degree 1 or 3. There are three times as many end-vertices as vertices of degree 3 in T . What is the order of T ?
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