Scribd
Upload
62 views3 pages

UNIT 2 Test Important Questions

The document contains important questions for a Unit 2 test on graphs, covering definitions, theorems, and properties related to graphs, including adjacency and incidence matrices, isomorphism, and specific graph types like complete and bipartite graphs. It includes both theoretical questions and practical tasks such as drawing graphs and proving theorems. The questions are categorized into two parts, with Part A focusing on definitions and calculations, while Part B emphasizes proofs and graph construction.

Uploaded by

palanisamydharshini615
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
62 views3 pages

UNIT 2 Test Important Questions

The document contains important questions for a Unit 2 test on graphs, covering definitions, theorems, and properties related to graphs, including adjacency and incidence matrices, isomorphism, and specific graph types like complete and bipartite graphs. It includes both theoretical questions and practical tasks such as drawing graphs and proving theorems. The questions are categorized into two parts, with Part A focusing on definitions and calculations, while Part B emphasizes proofs and graph construction.

Uploaded by

palanisamydharshini615
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

UNIT – 2 TEST (Unit – 3 Graphs) Important Questions

Part- A
1. Define Graph.
2. Define Pseudo graph with example
3. Define incidence matrix of a simple graph
4. Obtain the adjacency matrix of K5?
5. State the handshaking theorem.
6. Does there exists a simple graph with the degree sequence {3, 3, 3, 3, 2}?
7. How many edges are there in a graph with ten vertices each of degree five?
8. Let G be a graph with ten vertices. If four vertices have degree four and six vertices have degree
five, and then find the number of edges of G.
9. An Undirected graph G has 16 edges and all the vertices are of degree 2. Find the number of
Vertices?
10. Define complete graph and Draw the complete graph K5.
11. Define bipartite graph.
12. What are the necessary conditions for G1 and G2 to be Isomorphic?
13. Define isomorphism between graphs.
14. Define Path matrix.
0 1 0 1
1 0 1 0
15. Draw the graph represented by the given adjacency matrix 
0 1 0 1
 
1 0 1 0
 0 1 0
 
16. Draw the graph with the following adjacency matrix  1 0 1 
 0 1 0
 
Part- B

1. Prove that the number of vertices of odd degree in a graph is always even.
2. Draw the graph with 5 vertices A,B,C,D and E such that deg(A)=3, B is an odd vertex,
deg(C)=2 and D and E are adjacent
3. Draw a complete graph K5 with vertices A,B,C,D,E. Draw all complete sub graphs of K5
with 4 vertices
4. State and prove hand shaking theorem. Also prove that maximum number of edges in a
n(n − 1)
connected graph with n vertices is
2 .
5. Define (i) Adjacency matrix and (ii) Incidence matrix of a graph with example.
6. Determine whether the following graphs G and H are isomorphic. Give reason
7. Define Isomorphism. Establish an isomorphism for the following graphs.

8. (i) State the necessary condition for two graphs to be isomorphic. Show that the following two
graphs are isomorphic (10)

(ii) State and prove Hand-Shake lemma for graphs (6)


𝑛2
9. Prove that for a bipartite graph with n vertices has maximum of edges
4
10. Establish the isomorphic for the following graphs

11. Define a subgroup. Find all the subgraphs of the following graph by deleting an edge

12. If G is self complementary graph, then prove that G has n  0 (or) 1(mod4) vertices
13. Define isomorphism between two graphs. Are the simple graphs with the following adjacency
matrices isomorphic?
12. 0 1 0 0 0 1  0 1 0 0 0 1
1 0 1 0 1 0 1 0 1 0 0 1
13. 
0 1 0 1 0 1  0 1 0 1 1 0
  
0 0 1 0 1 0  0 0 1 0 1 0
0 1 0 1 0 1  0 0 1 1 0 1
  
1 0 1 0 1 0 1 1 0 0 1 0
14. Determine which of the following graphs are bipartite and which are not. If a graph is bipartite,
state if it is completely bipartite?
15. Define incidence matrix of a graph. Using incidence of the graph G, show that the sum of degrees
of vertices of graph G is equal to twice the number of edges of G
16. Represent each of the following graphs with an adjacency matrix (i) K4 (ii)K1,4 (iii) C4 (iv) W4
17. Let G be a graph with adjacency matrix A with respect to the ordering of vertices v1, v2, …vn.
Then prove that the number of different walks of length r from vi to vj where r is the positive
integer, equals to (i,j)th entry of Ar
18. Examine whether the following pairs of graphs G1 and G2 given in figures are
isomorphic or not .

19. Define (i) Regular graph with example (ii) Complete Graph with example (iii) B ipartite Graph
with example (iv) Complete Bipartite graph with example

You might also like