A tree T has four vertices of degree 2, three vertices of degree 3, five vertices of
Fantastic news! We've Found the answer you've been seeking!
Question:
A tree T has four vertices of degree 2, three vertices of degree 3, five vertices of degree 6 and no other vertices of degree 3 or more.
How many leaves does T possess?
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Posted Date: