Scribd
Upload
4 views

Unit - Iv

Uploaded by

Nagaraju Guntru
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Unit - Iv

Uploaded by

Nagaraju Guntru
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT – IV

2 Marks Questions:
1. Explain adjacency matrix of the graph.
2. Explain Hamiltonian graph with example.
3. Define Euler circuit and give one example.
4. Define Cycle graph with example.
5. Find the adjacency matrix of K 4 .
6. Explain complete bipartite graph with an example.

5 Marks Questions:
1. Explain the following graphs with example each.
i) Complete graph
ii) Bi-partite graph
iii) Complete bipartite graph
iv) Wheel
2. Example the isomorphism of two graphs with example.
3. Give an example of graph of order 6 size 6 with degree sequence (2, 2, 2, 2, 2, 2).
4. Show that the graphs G and G  are isomorphic.

5. Find the union and intersection of the following graphs G1 and G 2

6. Show that the two graphs G and S are isomorphic.


7. Draw the following graphs:
i) 2 – regular graph ii) 3 – regular graph ii) K 2, 5 iv) K 3, 3
8. Write the rules for constructing Hamiltonian paths and cycles.
9. Write the difference between Hamiltonian graph and Euler graph.
10. Find the number of edges in 4 – regular graph of order 3.
11. How many vertices will the graph have if it contains 21 edges, 3 vertices of degree 4 and the
other vertices of degree 3?
12. Find the number of vertices in a graph containing 3 vertices of degree 4, 2 vertices of degree
3 and remaining vertices of degree 2. Given that the number of edges in G is 11.
13. Explain about the adjacency matrix representation of graphs. Illustrate with an example.
1 0 1 1 0
0 0 2 0 1 
 
14. Draw the undirected graph G corresponding to the adjacency matrix 1 2 0 0 0
 
1 0 0 1 1
0 1 0 1 0

You might also like