Beruflich Dokumente
Kultur Dokumente
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS
CS6702
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS
7. Prove that, there is one and only one path between every pair of vertices in a tree T.
8. Prove the given statement, A tree with n vertices has n-1 edges.
9. Prove that, any connected graph with n vertices has n-1 edges is a tree.
10. Show that a graph is a tree if and only if it is minimally connected.
11. Prove that, a graph G with n vertices has n-1 edges and no circuits are connected.
CS6702
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS
2.
3.
4.
5.
CS6702
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS
4.
5.
6.
7.
8.
9.
CS6702
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS
CS6702
GRAPH
THEORY
AND
APPLICATIONS
2&16MARKS
QUESTIONS