T is a tree and V is a vertex of T of maximum degree in T, say the degree of V

T is a tree and V is a vertex of T of maximum degree in T,
say the degree of V in n. Prove that T has atleast n
vertices of degree 1.

Question Posted / guest

No Answer is Posted For this Question
Be the First to Post Answer

More Engineering AllOther Interview Questions

how to send request to the direct server rather than proxy server

difference between java programming and c programming??

what is the work of Loopback ?

verbal quiz and answers

program for inter process communicatin using message sharing in unix c

Briefly describe your ideal job?

What is ball bearing concept & its design.

what is the best part of your life ?

can u tell me any JAM topics.........and answers also...plz send me.........e-mail: anitha839@gmail.com

what is the differences between software engineering and other engineering disciplines.

what are register variables?what are the advantages of using register variables in c language?

7)8 mark X Y Z X Y Z + A B - A B -------- --------- C D E F B G A find X,Y,Z,G (8marks)

For more Engineering AllOther Interview Questions Click Here