0% found this document useful (0 votes)
148 views

Graph Theory Exercise

discrete structures

Uploaded by

022bim039
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
0% found this document useful (0 votes)
148 views

Graph Theory Exercise

discrete structures

Uploaded by

022bim039
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/ 4

EXERCISE

1, Considering the following graphs, determine ~


(i) whether each of the graphs shown is a simpl
.") t et (". ")
h ul •
e grap , a m tigraph, a Pseudograph ~!
(n ver ex s · 111 edge set f
I

(iv) degree of each vertex (v) degree sequence of each graph


(a) (b) (c)
b
a
C

d C
d
2. Draw the following graphs:
(i) two 3-regular graphs with six vertices.
(ii) two 3-regular graphs with eight vertices.
(iii) if possible, a 3-regular graph with nine vertices. If it is not possible, explain why?
(iv) the complete bipartite graph Ka, 5. 2>< -;-. J l..
7
3. Consider a graph given below. Find the degree of each vertex and A<E---+--===~c ,:;,
verify the Handshaking theorem.
4, Draw a graph with five vertices v1, v2, V3, V 4, V5, such that deg (v1)
= 3, v2 is an odd vertex, deg (v3) = 2, and V4 and V5 are adjacent.
5, Consider the graph Gin question no.3 and find
(a) all simple paths from A to C.
(b) all cycles
6,
Consider the graph given below and find the following
X y z
(a) Subgraph H of G induced by V(H) = {B, C, X, Y}
{b) G- Y (c) all cut-vertices (d) all bridges
C'l a •d 9. How .maar ._..
.ttctepee o~ 2' "•·

. t . morphic.

(a) G➔0~:~P~ ~➔,..__---v ~c)


(d) .
G'

9. Show that the following graphs are isomorphic.


1 2 3

G'

10. Draw a graph with given adjacency matrices

~)[! [l
0 1 1 1
(a)rn 1
0
1 !] 0
1
0
1
0
1 i] (c)
0 1
1 1
0 0
~ld)[i2
0
4 i]
0 1 3 0 4
2 0

(e) [i 0
3
0
3
1
1 f]
1
(f) 3
0
2
1 1 0
3 0 0
1 3 0
1
2

~n
4 0 1 2 3
2 2 3
0
2 i] (h) [~
2 2
2 1
1 0 l]
11. Axe the simple graphs with the following adjacency matrices isomorphic?
l 1
(a{~ !] [! ~]0
0
1
0 (b)[I
1
0
0 0
0
0

12.
1 0
1
0
0
l
0
Determine whether the graphs with theHe inc:idPnc(~ rnatrices are
0
IJ [~ 0
1 !]
isomorphic.
1 0 0 1 0 0

13.
[!
0 1 0
0 0 1
1 1 1
1 1 1

rm
0 0 1
0 1 0
Determine whether the given pair of graph is isomorphic.
~]
,V2

1S]'
VI

a VJ a
lit\ vi
(i) (ii) V t'l

IU U4
U1
Ua
(iv) 111

•••
0
\Lt
U1 Us
G
Ua VI

e1 V1 82 vz
VI

14, Find the incidence matrix and adJ'acency mat nx


. of

15,
the graph adjoining.
Draw the graph G corresponding to the £ollowi·ng d'
l
1
A= [ 1
1
0
O
1
]
0
O
2
0
2
t ·
a Jacency ma nx. Ti v,
ea
v3

2 0 2 2
16. Test each of the following graphs for Eulerian circuits and Hamiltonian cycles
(i) K4 (ii) Ks (iii) Ka, 6
17. From the graph in fig below, state that
(i) Is the graph Hamiltonian?
(ii) Is there a Hamiltonian path?
(iii) Is it Eulerian?
(iv) Is there an Eulerian trail? D
18. In each case, explain why the graph is Eulerian and find an Eulerian circuit.

(i) (ii)
G

C
H · K t. ?
19. (a) How many edges must a H:3:miltonian cycle m n con am.
(b) How many Hamiltonian cycles does~ have? '
20. "k , al "th t fimd the shortest path from A to E in the following weighted
U se DIJ stra s gon m o
graphs. Ho-~---~

6 F

A E
A E (ii)
(i)

C D
C 6 D
4
A.-..J.--0---"'---""°
D (iii)

4 6
I n--------oJ 22
uppose that a connected planner simple graph has 20 vertices, each of d F
egree a
~ may regions does arepresentat,on
.
o
f thi 1 l't
s p anar sp 1 a plane? . r,,~
What is Euler's formula for
. planar graph?
. How
1 can Euler's formula£or planar
can be used to show that simple graph 1s non-p anar. graph
24. Which of the undirected graph in the following figure have an Euler c· . i
25. What is chromatic nwnber of km, • and kn. ircu,t? EXJJ]ah,.

26.
Draw the diagraph D given that V = {v1, v2, vs, V4, V5} and E = {(v1, V2) , (Vl Va} (
3
(
v2, V4) , (v2 V4), (va, va), (v4, v2)} ' , V2, v
01 ),
1

27. Find the relation determined by the given diagraph. a~---+-

. d~~~c
28. Draw the diagraph D of the relation R on V = {l 2
(2, 4), (3, 2), (3, 4), (4, 1), (4, 3)}. • • 3, 4} defined by R = {(l, 2), (2, 2),
29. . a directed graph D, w h"ic h.1s given
Consider . below X9;:--+-----A

(a) F~nd all simple paths from X to z.


(b) Find all cycles in D.
(c) Find all the indegrees and
(d) Are there any s . outdegrees of each vertex of D.
ources or smks? Z
(e) Find the subgraphs H f D d . .
(f) Is D unilaterally c o etermmed by the vertex set V(H) = {X y Z}
30 C onnected? Str I , , .
. onsider the directed .. ong y connected?
(a) Find the simple ~haph D m following figure.
(b) F' pa 8 from V1 to V V:i
md four cycles in D . . a.
(c) Is D unilat ll which includes Va.
31. F' d
~ the incidence
era y connected? S
.· trongly connected?
adJacency mat . matrix and
below. nx of the diagraph given
6ft

CJCJQ

You might also like