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.
No Answer is Posted For this Question
Be the First to Post Answer
where is the first vidhyalaya of physically handicaped
hi to all,i done ccna,now im looking job,but it is very diffcult to get job in networking field,.........i dnt know what im doing wrongly,kindly help me and give the proper way...i have so much of interest in this field only
i want a program in c# for 100 or for a number greater than 100.....pls help
why this companay? For example: Why Dell?
pls explain this prog logic
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.
W.A.P to take input of an array and display the entered no. in dos.
gsm features
I want to know the relation between GI pipe ID, water flow rate in lpm, static head and friction head losses, motor kw for that flow etc.
what type of questions pannel ask to the intervier? plz i want questions about computer engineering? System security subject.
Please. Does someone know how to inicialize tapes in ATL? I need have 100 tapes to init inside the ATL, how is the process to complete this request?
I am selected interview for computer sc.please give me some information how many types question asked in interview.my id is sumanadas10@gmail.com
Civil Engineering (5086)
Mechanical Engineering (4456)
Electrical Engineering (16639)
Electronics Communications (3918)
Chemical Engineering (1095)
Aeronautical Engineering (239)
Bio Engineering (96)
Metallurgy (361)
Industrial Engineering (259)
Instrumentation (3014)
Automobile Engineering (332)
Mechatronics Engineering (97)
Marine Engineering (124)
Power Plant Engineering (172)
Textile Engineering (575)
Production Engineering (25)
Satellite Systems Engineering (106)
Engineering AllOther (1379)