<br>

MA2105
A gsnph a (v, E), oontis is

v(+) Nertias) aa E (edges)

Loep An edge he Sawe

blw te vetes
b Same set of vvtio
Uore than 1 edgo
MwEiedge:
Simple Gophi A qroph without loop orr muttidge

between
Vento a asjacunt t an edge eist
them
ineident v
An {e e is adacenttoa ventexv it is
Rnd ooints of
he
Neighbohood of a, vetex then
neghbstioad
 , and tueidence vatu'k
<br>

A4jaceney MatsÙX

adjatent

Adjanteyey
MatriX symnmetriegph
for undiyeeted graph etheqonally
dagonizabla
+ A
ghaph

Ahhh

, Vn
inedence Matyx
neident
1;e V
O; otheuise
eacheoloum
eontalusOnly

lach ow:

Vesrtexobe
ísolated vestex,
degree (v;) 0
MinoY S
hlncipal NinorS
ith ouo
ipelee
Coloumvn
<br>

priuciple Miuersi bigoual atrix

.|yI
pmuciple NinoS
2Y2
riveipe
2 X2
Submatrie:

ae adjatent

eneiple,
in rlECG
pruneiple minors of G
Sum, of 2*2
3X3 pniple Minns?
AWhen
None
odjacent
al aljacent :
then
inoYri ae tacnt
When al
pairwi'se
prtneple

cency > neidne atoik

Relaion blw adn
Matix ent
bb+Agoeach ogoual,
Aegree
(Psove aeo
two jl

(i+))
<br>

Ninimum dogree

AG) Maximun,degree

voYtices have
A q3aph is d-suqule if all' its

Handshake theorrem

3 oosular qraph poss jbte for

Not Þssilble
27 2]EC))
vertloe) with
Every qnph has even
Aqorees.
H a6toA N(H) V.C)
Subqraph
E (H) t (a)
. spanning subgra if. v() va)
ph
=

Vertex
4 [nduced Subgaph choese V) cv (6)
then Seleet all inldent
edqes.,
<
.Ede Induced Sub va ph iChoose ECH)
E6).
Then select sub graph
<br>

MA2105
el 2
edg e -ivdu ce d sutraph
4 5

2
vetex -induced
v tH)
>,2,4
1
2 Gaph Tsonorphism

4
4
teomostphie Graphs
G,-ME)
bijechon
isomonphisn iG,y
An
V, to V st uviettu)).
a
=
)
= d
¢4)
an eguivalene gelation:
isewaorphisn of 9ph is
isomonphic
A ruopvty presvuea by graph
i's eaud
a qaph invaiant. (is isonmorphi

attek.
duqees of ench
<br>

<Not
No l: ot
isomorphie -
ewposition exist L/w
N

Speeial Goahs
Kn9 complete gouph of n
vrtices
(ue adge)
tmpty Gruph
V=V, UV
Bipantte Graph
' V, nV and
St. has bne endpoint
evey edge
anothe at
V

at v even length
Oly
Biparite & 3 an
Complete Bip oortte Goah • pala
edqe blw each

of vorH in
noth vertex
eyele; take cyele
vetek of tae
AA
Wheel:
wth eAch
connet

Vertc
<br>

ttieorrewn: simple qoaph is bipoottite

pocstle to assign gue of
to dktteent
so
vttex, p! &
that
uuo
to adyatent veortcis hae
have -the
Same eolot
suppose G is a Simple bipanttte gaph.
Iroof
e V,

e we ass ign a cologA al vet'as

to Va
f
iRtvent colow to all vutia3 of
colo
and vetces
then sin ce 6 is
no
to
bipartte, odjacant. .

of te Sane eolon
we an colona G G
with two
Sup pose that
adjacant
Coloss eotbus
has Bame
vetices one colout
vesttes of
th set af
he
Let, M. be

and Vo be the Set of

vortce) of sane au
Sinte , no tw0 aljaent betneen venties
is no edqe
tolover So the
in V,
eant be aseated
( path: voties ean be epeate
)walk 8 voties
eveg walk eorrtalns a path
n it:
<br>

MA2103
Nalk Patth and yee
G
ic « equen Ce of vortio) Cv,M,
A
A k
in
E(G)
and a gequende af edqes(v, V;+1) eb
A WAlk is a
path if all V:' ae digrste
K
edge,
A
pth with
s a eyde
(Vo, e)
taen hat v
b
lwn
eontains a
path bw
u V

# Evey Wak A
Wnk'
inducthio on the length af the
; the nalk is a path:
any nalk
AsSume the stalement
s
tse fo

Suppose leugth of eneey nak bw uv is +1.

a
path
, e
ae one
if thee
a walk
Then v) is
with length '<u.
btueen dr
hypotesis 3 path blw
so; By' induetion

* Evoy araph with ontn a

a
path of

aud a
lergth z6
iuG
be 4he longest prth tu.
teonf :"let Va,...
togest path:
<br>

Let of V st i is
Kmallet )

cyele o!
a
legth (k-i+).

yele of lergta
) a

Gouph A gorash G is eoMne eted ie

Conueeted Goph
for evesy pair of vetes
:a path b hem

cownected eowponent af
G is a connected
by inelusfon
A

is maximal
ub qouph jthat- he
is only. 1 tonheeted lomponeht
4hee
s Lonetted
A qtuph G witth vetlees
fropi conneeted ebmponent,
has atteast -w)

Conneeted
. edge) acyeli'e qaph h-t

Te ' eAch aeitteonne eted

frest
AA
qaph whee
a tree'
teeipr
a each of veta.
a uigne path blw
al foratreeJ
lemma'. Any 4ite tne
with atteast 2-Vectiees has

att east leaves.

<br>

MA2l05
2 verteet
lemnai(ye tnte onetoe oith atleast
has atteast lea
A ue with Vettos edges.
()
fo tee with atteatt 2
tii) Evog fite atteast 2 (eaves.
Vertices hs
Hvof) tes assume ; 3 a
tee wth 2
vitttes
haung ne Jeot.
degee of ea eh Vetex
say; stat frum
,.Sine d(v) 22; V, hay

two neighbouss atteast say

Take an and 9ach
He nd yele Else;
<br>

Vy
bweqo totongh other he nighbo of
Eventoally
and eVentually foomn
a
an
yele
eortsadetton
NAakes
tuis
initialuy assunmed (T is tinite).
oue leaf
1l has atleast
foof () : By inducton
Base n|
A
thee
w
th k ottte)
Induetion ypotheis

nduetton step ? n=ktl a

tee with
Suppose 6is Hence
G
has
KtI
kt| tcs
ateast I leaf. (Aema 4)
Say (u)
G is a has
then k- edges. thus
G

hehce has

wtt exatty one laaf.

Proet (3) spose6is te a
teat has degree 2
ex ept
Vptees the
)A cegree
ha )
v 6)
V'e va)
=
(l0)1 +)
(ontaaittn)
<br>

3 a single
Theonem; A
qonh G ic a troe ifits vrticeg.
path blw
awy two of
[DIY

A spannivg Tee is a subgaph «f

PSpaning Tut is -tyue

LOntains ovey vrtx op

num be af spannigTres :
Total a eomplete gaph)
vetices (from
a
is alod
Cut edge : An edge cf a
aph
deleing that edge di'seoneet
t
cut-ege if entedge
is
ede
a eyele tant be a
An edqe
tontaind in
im
Lona ust- ede
n votie
theoem : a) Evey eonnected qaph
edges and hence
atteast n-t
has
8panhg taue
a tnee is eut-edge
a

£vey edqe of nateg

(b) toee
an edge
a uniue,yle
are tnes wit
##
|# cyle's fernmua
fomua .thne
t wentex set ,2.) n3.
()-(n-9 -(n
<br>

MatixTree
M= cT theogem
G

ineidenee matX of's eslaced with -

with nt
tf the
- G)

Matx -Te theonn Mi;

Prinelple ubmatix
gcon and ith
tetet
ta)> det deleti ng th
.
tolumn
ta) =no. of spamnig
<br>

MAIO5
M et M;;

Matsux Tue tthornm

=
det (Mii)
tCa)
Cauehy- Binet fortula a an
matouk ant
is

T Pis an then

det (re) >

zat (t)det (49 eo)m set
subwatik
o P
tith
PY 2

2X3
=
det (e)
2 3

4 6 I 2
6
<br>

n
Connected y
has atleast
e attcatt n eolumns
cdg es, Hente has
a
N ie
det Mii - et N)(det N") koe
N
INhoe NS ay n- n- submatu'k ol

tis eoespond.
pcag (n-) ventics
to cAoosing a
spanning

eorres nond to a
tu el of
N

6 with n-l edey andM vetley

Snppose ttat ub on o
the snbasAph herhg
spanning Toee.
isnt vestex
component thut doesnt eotin
3a entiies 8orhespondl'ng
to that
determinant
the
Assum yat the .col s
o N span a
tre.
yertex
be t He cdqe in eidentto Ji' n
toee nith
Deletig .e :We obtana
venties
of dge 1 let ez be
a
ventex i+i
Jat
ent
ineid to
tu dge
<br>

MA 2105

Conncttiviy of Gonph (h veotex Connectivity

() tdqe enneetvtg
() vote* tonneeiviy having
&
kn = tonnplete Gouph
connebivrty -n-1
K(a) Veter
2-eometed q9ash
iseonnet
hmove 33A4-to
&4-to
6
be removed to
Mìn nmbes
o vertiy to
dis cennected
Ymafe
te qaph
fupositon goaph a; Ka)s S6).
k(a)
= 6)=n-1
belettng
VeG B d (v) Fa).
let; So
dswnne ets the q9aph:

6)Bdge tonneetirity diceomeetg set af edges

A

set one eonponert

has tha
mo

S,T peifes the

Y(G) 4he notation e
Given s,TE S the
point in
edqes having
one end
set of
s,s 7
an edge t of the tom
An edge cnt is prop subset f V

where s is a
non- enpty
conn ect qouph.
s,s] - alsays tod's
going
<br>

A
qaph is
d'seomneting get has ateaot K edqe

eonneetivity ef a. ka) of
is the min.
The cdgc
sine f a
diseoeeting &et.
edee disen netting &
is called bridge /eutege
edges
Pmo althevete
lattached toone pne

nemove
Ra) >2 lor (s, 6)

R(a)> 3
diseomn ectig 'get bt not,
An edqe ut is

Vie-vesa se aut.
t eve4 minimad diseonmectg
3

4 d'sconneet'ng set
Nhimum
fe,,e,e,9?
Theonem p a
Witneys qaph
to Vtex
ineident
Psrof i the edaes
di'seonne ethg Bet.
deqree foam

Now; s,5] is edye cut

an edge wit smallest siz0.
(KCa))
<br>

Case1 isuppote ewoy vitcx of S

is adjacet to
vesrtex af S.
Ny
- k(n-k) =
k=| kG)
min when

Suppose 3x es
y eS s.t
taseTr: eonsiting of all
T be tthe
Vertex set oe
let all veerticos
is -s and n G.

Sfx-that hare neiqhbos all the edges in

Pepno v'vgt destoy8
(This doeon' include
+
T
and
jection -b/ sS]
s 6,3) | Kla)
K(G) < It

Ka) <RG)

BlOck
A maXimal onneeted
ut vUtek

8lock

Block
Block
K conn
: A graph is
Menges then it eontans
K nternally
patths ay too vertiees.
disjorat
<br>

intennay disjo int pats if neiter

tvo paths
a
non-end pt. ventcA of the
of the ott
toutus
We denek e. (ength of the shotest gatth t
<br>

MA 2105

G haw mg ateast 3 yertices is

A
gnath u,v e V(G) is
theom ench palon
2 -conneled iee op interally
Connetted by a pair

Suppose 6 is 2- connectel
Conveeve o on d (u )
pro by indutfon eonne cte
Ne u, v is til
dlusv)) ;6
hypothes's :
Tdetton
statement hold fon allJ(u, ) kk
t
A(u, v) k
Now; eonside v
w
be tt Vwry belere
Let
foum
intenally disioint 'prths
Let; has

R
2-conne
2-conne tted;
tted; {w 1S
sluce G is
contans a (u,v) path
Gw} trees of kn
No. of panning
pannig
t ayeys Theorm

x
(n) (

(n-) x (nr)
<br>

Yongsbong Bude lem

Pob t>

4 Rants of
A,B,,p
A
7bidyes
D
stat
gont,take
at ay
exactty: one, ehd atoe
poirt
A walk with no nepeated edges
A
iailal A
a mutigrap h
An Euleian tal in evcoy ede ty Dn eva -

G pass ing thogh ton

in , is ,ealed elesian
14 the Nalk is, elosed it

eonnetted g9aph hal

an eeuan tr
A
teosemi ife each vette, has an evcn dege

Vetices of odd degiee

an even qaph
tomna Evey nasialitineven doqee) ts
is dose
vetek having
(ach
truil. -
a
maxima tnail
has an ada
1et t be
froof T

tA not
Tis loced) then
îmeident U,
1eident to tAe (ast Vvest
nunher ot adges