Scribd
Upload
6 views5 pages

DM Unit-V QB 2023-24

discrete mathematics

Uploaded by

Godha Nemmarugommula
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
6 views5 pages

DM Unit-V QB 2023-24

discrete mathematics

Uploaded by

Godha Nemmarugommula
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/ 5

R22

Aushapur (V), Ghatkesar (M), Medchal (D), Hyderabad T.S. – 501301.

DISCRETE MATHEMATICS QUESTION BANK


UNIT-V GRAPH THEORY

Short Answer Questions (1 Mark)


1. Is there a graph with the degree sequence ( 1 , 3 ,3 , 3 , 5 ,6 , 6 )?
2. Explain the procedure of two graphs to be isomorphic.
3. Discuss the complement of graph G with example.
4. Discuss the directed tree and non-directed tree with example.
5. Discuss the spanning tree with example.
6. Discuss the planar graph with an example.
7. For the graph shown below, indicate the nature of the following walk CBAPBQ

8. Write the Euler path for the following graph.

9. Explain the Hamilton graph with example.


10. Determine the chromatic number for the following graph
Long Answer Questions: (5 Marks)
1. a) State the handshaking lemma.
b) Suppose that G is a nondirected graph with 12 edges. Suppose that G has 6 vertices of degree 3 and
the rest have degrees less than 3. Determine the minimum number of vertices G can have.
2. Examine the following two graphs are isomorphic or not.

3. Discuss the following terms and represent them with at least one example for the given graph G.
a) Subgraph of G.
b) Spanning subgraph of G.
c) Induced subgraph of G.
d) The complement of a graph G.
e) The graph G−e and G−v .

G
4. Discuss the binary search tree and draw binary search trees for the following lists:
a) 18, 44, 2, 5, 73, 45, 14, 6, 8, 10, 20, 11
b) 2, 1, 5, 6, 8, 9, 7, 3, 4
5. Draw a planar representation of the following graphs.
a) b)

6. Apply Kruskal’s algorithm to determine a minimal spanning tree for the weighted graph shown below:

7. Apply Prim’s algorithm to determine a minimal spanning tree for the Weighted graph shown below:
8. Explain Euler’s formula and then verify the Euler’s formula for given graph.

9. Determine a Euler circuit in the graph shown below.

10. Determine the chromatic number of the following wheel graph.

Long Answer Questions: (10 Marks)


1. Discuss the following graphs with suitable example.
a) Directed and non-directed graph
b) Connected and disconnected graph
c) Simple and multi graph
d) Planar graph
e) Complete graph
f) Bipartite and complete Bipartite
g) Regular graph
2. Prove that the following two graphs are not isomorphic.

3. Examine the isomorphism of the following two graphs


4. Consider the following two graphs G1 ,G2 . Then obtain the following.
a) G1 ∪ G 2
b) G1 ∩ G2
c) G1 ∆ G2
d) G1 ∪ G 2
e) G1 ∩ G2

5. a) Explain the procedures of DFS and BFS.


b) Obtain the spanning trees using DFS and BFS for the following graph.

6. Apply Kruskal’s and Prim’s algorithm to determine a minimal spanning tree for the Weighted graph
shown below:

7. Prove the following:


a) K 2 ,2 , K 2, 3 are planar.
b) K 5 and K 3 ,3 are non-planar.

8. a) Explain the following and then illustrate with suitable examples.


i)Isomorphism
ii) Multigraph
iii) Euler circuit
iv) Hamiltonian graph
b) Prove that a complete graph Kn is planar if and only if n  4.
9. Show that the following graphs are Hamilton graphs but not Euler graphs.

10. Determine the chromatic numbers of the following graphs:


a) b)

You might also like