FirstRanker.com
PAPER ID: 113606
(SEM. VI) THEORY OF GRAPHS
--- Content provided by FirstRanker.com ---
Time: 2 Hours]
Note: Attempt all questions.
- Attempt any four parts:
- State a necessary condition for a graph G is to be Hamiltonian. Explain with example.
- State and prove four color conjecture.
- Using Kruskal's algorithm to find the minimal spanning tree of the following graph.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University
--- Content provided by FirstRanker.com ---