Professional Documents
Culture Documents
Unit-4 Graph Theory 1
Unit-4 Graph Theory 1
Símple d mulhi
Ace)
()
vertex oih o' degreeTsolohed
Vetex toilh degee >Pedank
>
,In degrec (dey- (v))
of dreced gtach, the indeqtee of vete V, s
In Case of
b
e
d
V3
sosr Hte gaph : Asimple graph G is called Biparite,
is vertex set V can be porhhoned into toD
disjoints sets V & Va Sch that every cdge in the
connechs the verter in y & he verer V
S0, that no edge in G connects eitho too verhces
h V and Vs
y: fa, b, c, d,c, f. g
salV fa, b,dy
V {c, e,fsg Yes, B-P
b
V- fa, b, c, d,d, t?
*Adjancey Marix
b cn
b
C 1I0J3x3
t G (VE) is a simple graph having 'n' vehes
Then Hhe adgencey matrix of the groph Lort to
yerhces s the nxn zero one matrix Such that
mstrit
Drao the graph of the
I00I
otheroise
V
Lso mor phiom giaph ?
Vu
Vgl3j
Ng (3) Vy (2)
flvs) Vs
Ve5 V:5
E5 E5
D(2,2;2,2, a) D (2,2,2, 2, 2)
t(U4)> V
1
Us1
. The given t
1 graphs are is omorphiom
1
U5
V(2) (2)
(3)
(2)
V
H.
V"6 V6
E 7 dEd
D: (2,3, 2,3, 2,2)D(2,2,3,2, 3, 2)
Mappirg: flug Vy
Vu 00
·Connechivity
Path : a seqvence of edges that
begins at avertex
Of a gra ph nd traves
from verter to vertex
along the cdges Of a graph
x: a’ d (re? pah)
a’C ’
a’ b Pa ths