Scribd
Upload
7 views

Graph_Theory_MAT206_Repeated_Questions (1)

The document outlines the most frequently asked questions in a Graph Theory course (MAT206), categorized into five modules: Basics of Graph Theory, Euler and Hamiltonian Graphs, Trees and Shortest Path Algorithms, Planar Graphs, Cut-sets and Connectivity, and Graph Matrices and Coloring. Each module contains various definitions, proofs, and problems related to graph theory concepts, including walks, paths, circuits, Eulerian and Hamiltonian graphs, trees, and graph coloring. The questions aim to test understanding and application of fundamental graph theory principles.

Uploaded by

prajithasanthoshpv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Graph_Theory_MAT206_Repeated_Questions (1)

The document outlines the most frequently asked questions in a Graph Theory course (MAT206), categorized into five modules: Basics of Graph Theory, Euler and Hamiltonian Graphs, Trees and Shortest Path Algorithms, Planar Graphs, Cut-sets and Connectivity, and Graph Matrices and Coloring. Each module contains various definitions, proofs, and problems related to graph theory concepts, including walks, paths, circuits, Eulerian and Hamiltonian graphs, trees, and graph coloring. The questions aim to test understanding and application of fundamental graph theory principles.

Uploaded by

prajithasanthoshpv
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

GRAPH THEORY (MAT206) - MOST REPEATED QUESTIONS

Module 1 - Basics of Graph Theory

1. Define Walk, Path, and Circuit with examples.


2. Define Complete Graph and Complete Bipartite Graph.
3. Define a Regular Graph. Draw a regular graph with 4 vertices which is not complete.
4. Define Isolated Vertex and Pendant Vertex with examples.
5. Prove: Sum of degrees of all vertices = Twice the number of edges.
6. Prove: A simple graph with n vertices and k components can have at most (n-k)(n-k+1)/2 edges.
7. Prove: If a graph has exactly two vertices of odd degree, there must be a path joining them.
8. Define Subgraph, Vertex Disjoint, and Edge Disjoint Subgraph.
9. Prove: The number of odd degree vertices in a graph is even.
10. Check whether two given graphs are Isomorphic.
11. Define Decomposition of a graph with an example.
12. Define an Equivalence Digraph with an example.
13. Define Relation Matrix and find for a given set.
14. Find Center of a Graph.
15. Prove: If a simple graph has more than (n-1)(n-2)/2 edges, it is connected.

Module 2 - Euler and Hamiltonian Graphs

1. State and prove the necessary and sufficient condition for a graph to be Eulerian.
2. Define Euler Graph and Hamiltonian Circuit with examples.
3. Prove: In a complete graph with n vertices (odd n >= 3), there are (n-1)/2 edge-disjoint
Hamiltonian circuits.
4. Explain Travelling Salesman Problem and its relation to Hamiltonian circuits.
5. Distinguish between Symmetric and Asymmetric Digraphs with examples.
6. Prove: A connected graph is Euler if and only if it can be decomposed into circuits.
7. Check whether a given graph is Eulerian and/or Hamiltonian.
8. Define simple, symmetric, and asymmetric digraphs with examples.
9. Find Union, Intersection, and Ring Sum of given graphs.
10. Differentiate between Connected Graph and Strongly/Weakly Connected Digraphs.
11. Define Arbitrarily Traceable Graphs with example.
12. Find values of m, n for Km,n to be an Euler graph.
13. Find Ring Sum of two given graphs.
14. Explain Hamiltonian graph conditions.
15. Conditions for a simple graph to be Hamiltonian.

Module 3 - Trees and Shortest Path Algorithms

1. Prove that a tree with n vertices has exactly n-1 edges.


2. Prove that every tree has either one or two centers.
3. Use Prim's Algorithm to find Minimum Spanning Tree.
4. Use Dijkstra's Algorithm to find the shortest path.
5. Prove: A binary tree with n vertices has (n+1)/2 pendant vertices.
6. Find the minimum spanning tree of a given weighted graph.
7. Find the shortest distance between vertices using Dijkstra's Algorithm.
8. Prove that every connected graph has at least one spanning tree.
9. Define Spanning Tree and draw a spanning tree of a graph.
10. Define Distance and Eccentricity of a vertex.
11. Find Center and Diameter of a Graph.
12. Prove: A graph is a tree if and only if there is one and only one path between any two vertices.
13. Find shortest distance from a source vertex to all others.
14. Find the number of pendant vertices in a binary tree.
15. Prim's Algorithm for MST for a specific graph.

Module 4 - Planar Graphs, Cut-sets and Connectivity

1. State and prove Euler's formula for planar graphs: e - n + 2 = f.


2. Prove that every circuit has an even number of edges common with any cut-set.
3. Construct the Geometric Dual of a graph.
4. Define Vertex Connectivity and Edge Connectivity with examples.
5. Prove: Vertex connectivity <= Edge connectivity <= 2e/n.
6. Show that K5 is not planar.
7. Find different Cut-sets and determine Edge Connectivity.
8. Define Cut-set and prove properties.
9. Find all fundamental cut-sets associated with a spanning tree.
10. Prove: In any connected graph, cut-edges belong to all spanning trees.
11. Define Balanced Digraph.
12. Define a Cut-Edge and its properties.
13. Planar graphs and 5-colorability proof.
14. Find Edge and Vertex connectivity of a given graph.
15. Properties of geometric dual graphs.

Module 5 - Graph Matrices and Coloring

1. Define Chromatic Number and find chromatic number of a tree.


2. Prove: Every tree with two or more vertices is 2-chromatic.
3. Define Incidence Matrix and list properties.
4. Define Circuit Matrix and find Circuit Matrix for a given graph.
5. Prove that in a connected graph, rank of incidence matrix = n-1.
6. Find adjacency matrix and comment on connectivity.
7. Define Path Matrix and find for given graphs.
8. Define Chromatic Polynomial and find for a tree.
9. Prove that every planar graph is 5-colorable.
10. Show that chromatic number <= dmax + 1.
11. Find circuit matrices for given graphs.
12. Prove: Graph is 2-chromatic iff it has no odd length circuits.
13. Find Chromatic Polynomial of a given graph.
14. Properties of Incidence Matrix.
15. Write adjacency matrix and incidence matrix for a graph.

You might also like