A tree T has 7k end-vertices, 2k 2 vertices of degree 3 and 2k + 2 vertices of degree 4
Chapter 13, Problem 15(choose chapter or problem)
A tree T has 7k end-vertices, 2k 2 vertices of degree 3 and 2k + 2 vertices of degree 4 for some positive integer k, but no other vertices. 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