Scribd
Upload
77 views2 pages

Graph Theory Question Bank

The document is a question bank focused on various topics in graph theory, including problems, definitions, and proofs related to graphs, trees, and connectivity. It covers concepts such as Euler graphs, Hamiltonian circuits, isomorphism, planarity, and coloring, along with algorithms like Kruskal's and Prim's. Each question requires detailed explanations, examples, and diagrams to illustrate the concepts effectively.

Uploaded by

Sudipta Kashyap
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
77 views2 pages

Graph Theory Question Bank

The document is a question bank focused on various topics in graph theory, including problems, definitions, and proofs related to graphs, trees, and connectivity. It covers concepts such as Euler graphs, Hamiltonian circuits, isomorphism, planarity, and coloring, along with algorithms like Kruskal's and Prim's. Each question requires detailed explanations, examples, and diagrams to illustrate the concepts effectively.

Uploaded by

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

Graph Theory Question Bank:

1) Explain the Konigsberg Bridge Problem. Explain with a diagram and represent it in a graph.

2) Explain Walk, Path and Circuits in a graph. Explain each with an example .

3) Explain ‘Arbitrarily Traceable Graphs’ with an example. Also explain ‘Hamiltonian circuits’
with an example.

4) Prove that the number of vertices of odd degree in a graph is always even.

5) Give a detailed description on the puzzle with multicolored cubes with diagrams.

6) Prove that a given connected graph G is an Euler graph if and only if all vertices of G are of
even degree.

7) Prove that a graph G is disconnected if and only if its vertex set V can be partitioned into two
nonempty, disjoint subsets V1 and V2 such that there exists no edge in G whose one end vertex
is in subset V1 and the other in subset V2.

8) Prove that a connected graph G is an Euler graph if and only if it can be decomposed into
circuits.

9) Prove the theorem: Every connected graph has at least one spanning tree.

10) What is a Binary Tree? Explain with an example. Mention some of the properties of a tree .

11) Kruskal’s Algorithm.

12) Prim’s Algorithm.

13) Prove that a connected graph G is a tree if and only if adding an edge between any two
vertices in G creates exactly one circuit.

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

15) State and explain all the criteria for detection of planarity with a suitable example.

16) Prove that the complete graph of five vertices is non planar.

17) What is 1-isomorphism? Explain with an example. Prove that if G1 and G2 are two 1-
isomorphic graphs, the rank of G1 equals the rank of G2 and the nullity of G1 equals the nullity
of G2.

18) What are fundamental cut sets of a graph? Prove that every circuit has an even number of
edges in common with any cut-set.
19) What is 2-isomorphism? State and explain the Operation 2 in details with figures.

20) Prove that Kuratowski’s second graph is nonplaner.

21) What is proper coloring of a graph and chromatic number? Explain with proper diagrams.
Mention the different observations that can be made from the given concepts.

22) What is an independent set and maximal independent set? Explain in details with an
example. How to find a maximal independent set?

23) Explain directed graph with example. Mention the different types of digraphs. Explain each
of them.

24) Explain the matching of a graph with examples. Also explain covering of a graph with
example.

25) Prove that the vertices of every planar graph can be properly colored with five colors.

26) Prove the theorem: Every tree with two or more vertices is 2-chromatic. Explain what is Four
Color Problem.

27) Explain edge connectivity and vertex connectivity with proper diagrams.

28) Explain what is a separable graph with proper diagram and description.

29) Prove that the ring sum of any two cut-sets in a graph is either a third cut-set or an edge
disjoint union of cut-sets.

30) Prove that every circuit has an even number of edges in common with any cut-set.

You might also like