Scribd
Upload
4 views

Graph Questions

Graph Questions

Uploaded by

yousefazam120
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
4 views

Graph Questions

Graph Questions

Uploaded by

yousefazam120
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/ 6

Chapter 8

Use the following to answer questions 1-5:

In the questions below find an ordered pair, an adjacency matrix, and a graph representation for
the graph.

1. K6.
Ans: Vertices  123456, Edges  ab  1  a  61  b  6a  b;
0 1 1 1 1 1 
1 0 1 1 1 1 
 
1 1 0 1 1 1 
 .
 1 1 1 0 1 1 
1 1 1 1 0 1 
 
1 1 1 1 1 0 

2. C4.
0 1 0 0
0 0 1 0 
Ans: Vertices  1234, Edges  12233441;  .
0 0 0 1
 
1 0 0 0

Page 117
3. W5.
Ans: Vertices  123456, Edges
 1 21 31 41 51 62 33 44 55 66 2 ;
0 1 1 1
1 1
1 0 1 1 
0 0

1 1 0 0
1 0
 .
1 0 1 0
0 1
1 0 0 1 0 1
 
1 1 0 0 1 0

4. Q3.
Ans: Vertices  (000)(001)(010)(011)(100)(101)(110)(111),
Edges = (a1 a2  a3 ) (b1 b2  b3 )   a1  b1    a2  b2    a3  b3  1 ;
0 1 1 0 1 0 0 0
1 0 0 1 0 1 0 0 

1 0 0 1 0 0 1 0
 
0 1 1 0 0 0 0 1
.
1 0 0 0 0 1 1 0
 
0 1 0 0 1 0 0 1
0 0 1 0 1 0 0 1
 
0 0 0 1 0 1 1 0 

Page 118
In the questions below fill in the blanks.

5. Kn has ________ edges and ________vertices.

6. Wn has ________ edges and ________vertices.

7. Qn has ________ edges and ________ vertices.

8. The length of the longest simple circuit in K5 is ________.

9. The length of the longest simple circuit in W10 is ________.

10. A simple graph is regular if every vertex has the same degree.
(a) For which positive integers n are the following graphs regular: Cn, Wn, Kn, Qn?

Ans: (a) All n  3, n  3, all n  1, all n  0.

11. Draw the digraph with adjacency matrix


0 0 0 0 
0 0 1 0 
 .
1 1 0 1 
 
1 1 1 0 

Page 119
12. Draw the undirected graph with adjacency matrix
0 1 3 0 4
1 2 1 3 0 
 
3 1 1 0 1 .
 
0 3 0 0 2
 4 0 1 2 3 
Ans: The numbers on the edges of the graph indicate the multiplicities of the edges.

81. Suppose G is a graph with vertices abcdef with adjacency matrix


0 1 0 1 0 0 
1 0 0 1 1 1 
 
0 0 0 0 1 1 
 
1 1 0 0 1 0 
0 1 1 1 0 1 
 
0 1 1 0 1 0 
(where alphabetical order is used to determine the rows and columns of the adjacency
matrix). Find
(a) the number of vertices in G.
(b) the number of edges in G.
(c) the degree of each vertex.
(d) the number of loops.
(e) the length of the longest simple path in G.
(f) the number of components in G.
(g) the distance between vertex a and vertex c.

Page 120
92. Consider the graph shown.
(a) Does it have an Euler circuit?
(b) Does it have an Euler path?

93. Consider the graph shown below.


(a) Does it have an Euler circuit?
(b) Does it have an Euler path?

Page 121
94. Consider the graph shown below.
(a) Does it have an Euler circuit?
(b) Does it have an Euler path?

Page 122

You might also like