Find the smallest possible number n of vertices in a tree that has four vertices of degree 3, three vertices

of degree 5 and two vertices of degree 7. Prove that your answer is correct

Let E and V be the number of edges and m be the number of vertices According to definition of vertices 2 E vef deg(v) m 4(3) 3(5) 2(7) m 12From properties of tree E v 2 (m 4 3 2) 1 m 8Equate the…

 

"Looking for a Similar Assignment? Get Expert Help at an Amazing Discount!"