Please wait...
THANKU FOR BEING A PART OF OUR JOURNEY TO BRING "REVOLUTION IN EDUCATION"
We Genuinely APPRECIATE your PATIENCE

search
close
22
M: +2.00/-0.66

Consider the following statements regarding trees:
1) A tree contains all the nodes of the graph.
2) A tree shall contain any one of the loops.
3) Every connected graph has at least one tree.
Which of the above statements are correct?

[ESE (IES) EC 2017 Technical]
A
B
C
D
Previous
Next