Discrete Maths - Graphs
22. The length of a Hamiltanian path (if exists) in a connected graph of n vertices is
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
23. A simple graph in which there exists an edge between every pair of vertices is called
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
24. The minimum number of spanning trees in a connected graph with 'n' nodes is
- Option : B
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.