hday 02.

032012

Exanple
Graphsof kuo nes) Gt Vortices
notl-empi A
crticus Each of E gaph
(or
dlemerks nodes sok &-
edqg
called V,)
Multzple
gaph Simple
gph Sumpl
graphe Gigraph
mple v UNIT: 1
utth g GIRAPHS
ar of
is caled Poitb) Conotsko
lop asiated
'and clements
o for
t Adjacnk lop erices Edqgos and oF
es-Vericas
Edge - Var
dagrez utlt (or acallad
relalian verbces)oenNoded
xs - -2 ’mulu
qraphs
loopgraph
’ige’6imple
5ame 5Utorderebpodanr
peakhee (Pirecbd) Gaphs
3 adiaart VV VertexPoints
O
incidarntV,
, Oraph: :ather

on
lu
ma

Motday 0603
lhe sane and ends loep bigns 20
NOTE )
R-)-grap. Examplc:9ek NOTE
caedloop. a 3)Ifatnhde caled brilia :)
grap A
multiple graph.
Ga=
edgcs Caary (V
E) 6)
here
or a utt
paralle rial
p v.
vartices ha,b,
edge. graph
c,d3
and gaph
o Ehe-
a a
0,0)-grap dggo i
ab, called
Gsrs

a
 Simple araph ,,Và aro -adacerk vruceG
Aqraph &-(V,) dthouk leops and trullipe cdge pirs of adjacent
Nertiros.
Gghs havir locps and mulple cdgos5 at callbd V and Ve ao
Podark vertes,
V, and V¡
400labd vertices (sine Va and Ve aug lited uth
e araph or chee they are
Incdarey ad adjaekceney » al oaph)
hey are ncidart with e tb Va
lat G(V, E) be a guph. If e u 15 an ge of
4, hen andv ars called adjaent (bucausa it an d.05.21patee of a vertea
do b jotn uand v) (or meighbours)in a. Ne sauy'e is 171e deae of a Varen n a qiaph G 5 the
mumber
intaknt

ncident utth edqs ncidenk with it.

A loop of a verte conkbubs deare:2 to that
NOTE vertea.
-agat i) If kuo or more edges ae incident with the 5ame
Degre of a verter is denoted by degcv.
adjnak vortaz, hon ha ae said to be adjacent edges. n the previous ezample, the graph ha9

re all 2) A Vertez O a aaph i6 called pendant vertex f only e deg (va) =2

adinceskdqe i nident ith it. (eandant Verer ill have dearee 4) deg(va) 4
Problerns deg (v) =|
o al yConaider the qaph and ndit caz al ypes of vertices deg (Ve) =o
a2
nadent b and edges Theorem:1
furdamental theorem of graph theoy (an Hand shaking heorem 9
*V,C,d pdank staement
Verlicos a6
onig ora vertex The sum of the degrees of he verte Vertices of a
wilh hem
graph Gi= (V,E) 6 kuiCe tre mrnber cf ecdges.
NG
ie, 2d0g (4) 24
(V,, Va) are adiacenk urticeo
 sn
Gome gpecial simple graphs
(rnok locp)
cdge i5 ncdent wtth kuo Vertices and
bery onkyribesutes yComylctu gh
dage 2. Every loop edge
Conkributeo
loop)
dege. Thercfore every edge (loop r hon
to the degres of Vertics
the
Coninbute 2 to Hne sum f
Vertices = 2e
5um of the degroes of

Theorem:2 Stalement» furst kuratouskds grcaph

16 even.
The munber of vertices cf odd deare
Proof »
the set ASimple gaph i6 called complele if here is exackly o
let a- (V, E) gaph. let V and Vy be
be a
resctorely dge bebDcen every pair of Vertices. and all verhns hoe Same
of vartices havng aen degree and odd degre
Uge. AComplele gaph on n' verticcs is dortad by hn
n G.
Ther, 2deg (v) - 2e (rom theoem:1] 2) Ragular graph »
dagree

vev, VeV,
2-regular - Tegular 3-2gular
Asmple graph is callad egular y ey erbL G
46 even 3 2k (5ay) graph has 6me dagy.

3) cydles:» [reub or uclie gaph

vEV
verlex
2 degtv) =2le-k) Ehan Gn s called a cycle.
VEVg
-even.
The o. Of Vertice5 f odd degree 6 even.
Hence ats provad. Acude viln varliccs
 adiacent
4) Whael Gataph
Whecl árph io
eprsentad by Wn, n>3,
a Varler v insde
oblaind jom Cn by addiry
vey verte o Cn by
and connechng v lo

NOTE
Abiartze graph is
also called as biqph
Complete bertite graph
01.08. 202 -Cubes (an) a (o)
tiadrasday The m- dümenabnal hyprtube -aNe -cute denoted bu let G- (V,E) bo a bipartate qaph with bipartition Va
If there an edge of G Connecbing every verez in,
Cn iIs he qcaph with ach verter epresenting Gne cf
and Vs hen G s callad a
the n-bib wods. Snce, there are 2" bit stings of Complete birtile graph.
langth n, &, has 2 vertice5. V

Toso vertices are adiacent if and only if the bit k,3

exacty n
strings thay Tepresent differs on pooihon . Tn other uoorde
buo Verices of Qn are adjacenk f the hamning
distance boween hem is ona. kurakoui's second
graph
ne conplet qraph 46
3g veri ces bipirtile
denoted by Kmn
NOTE )
000

*ka3 i9 called kuakoukis second qcaph.

Bipartie gaph » SubgraphY
A 6umpe gaph a is aled biartite
gaph lek Gi(v,E) be a gaph, A geph H=(VaE) 5 callad a
Nere sek v can be partiioned into two
dibjoirk Subgraph Of if VGV and EE
non-emphy sets and Vo Such that mo bwo Vertices
G V are adjacenk and no kwo vertices of Va
ae
 The sutgraphe ar,

G:

&03 2012 Spanrng 5ubgraph »

nduced subgraph of a:H )
Thursday If H-(V,, E) 46 4 Subaraph G a-(V, E) and iF
e

NoTE
A sparvang subqraph of a meed not cortain al tno

Complement Gaph
ne graph a called
lek a be a simple gcph, then

as that of a and such that

ron adjacnk
adjacent f and onla f nose vertices re
H: v,
SFanning Sukgraph V2

%Induced subgraph Vg
V
let G-(V, E) be a aach. let v be a rot- empg

Ond uhos
cdgos
 2 nd he
Malra presenlalan o graph and Isomofphum
adiacen maana g tha graph
The

UAicerc aaz
A)ncudera

4.03 202 Adacencu matru

Wadnasday
lat G-(V. E) be a Simple qraph uith n vertices. Then
V, 0
lak he vertces of a 6 denoted by V2 Vg, Vn
The adjacency mabix g a s the mxm matria (a,) A
uhere a, -j1 and y ae adjacent
O, otheratse

and denoted by A(a) OoV, nt adjacert to

Gif Mhas a loop V adjatere
Exarmple
yCoreider he graph. fnd the adjacency matia. Incidence matrz a
l2b G- (V,E) be a (a,m) qaph. leb M.Ya..Vn be tha
Verices and ei. e.,eg. .en be the edges of
The incidency matrix'M' uhee r 4 when he edgu B
oident uith
0, ctherui5e
Eample
Sdn ) wate doun the incident matrz oF the qgph n
The adiaancy makriz s V

O00I0I 0
 3)
The incudent mabiz

V
M

603202 4)

fuday V
0

Anwers 9

let a = (V, Ei) and Gz (Va, Es) be tw0 Smple graphs. a,

and Gg ae icomorphuc there is a one to one and onto

functim or map f: V,’e with the property that t and

V ae adjacent in G, if and only 4f fv) and fU) Claarly j 5 1-6-1 and onin and preeres cdjacaney
ae

The fncti¡n f s called arn isomophiam. 2)

Questins
e no. GE verlis i5
chack
Same in bo oroph
’1theck if he to.

thath if all verttus have

Sae deava relalion. Hene be hc graphs ars somorphuc. (a,an)
2) ,Va
3)
araphs eath vereat
have th Same
 (a,4as
The kao oyaphs a nok 6cmcrphic a)

4)

claarly f 1-to -1 and presNes adjaceny elain

The bao oraphs ae smorphic (G 26a)
Show thak the qraphs with the follouing
aajat en
maices are A80moçhic.
A=
i Ag
LiJ

lk us aply a coris kerchan

D0 and bie Coespending paa olunns
Conoider A [O I0

A,
R
tarchangtn R R

A ntarhanang
 nlchangig efs

pasontd by Ue adjaceey
3A The qraph isormorphic
malrias And A, ae
6) Tosk whether he grapha uith the folloutng adjaency
makrices ac isomophic or nok Ans: Refor back o TO0

Az

omotiuie

ú) A= A2

LI

sonmorphism of the graphs by coneidering ther

Test he
adjacercy matrices.
 The

V
A, V
V3 | 0 0

A Az Bolh the graphs are isemorphic

lolrg
Paths, Carcauits and Connecievay
end
verk
Rath Akanalu seque nce oj vertcas and eages
m u sb
l e

A path of lengeh (No. of cdge9 nha pan) f

othare

beconnes
A patn is an alkematang 5cqyan ce Veta
cdges.
Th0 verlucS Vo and Vn are called the cná r

arninal Vetex
NOTE >
 Example
V

(loiaest path i6 con9deved)

A pudn jrom
Crcuik (Cycle)» Cnro eoes
aycle if it
calcd a cirit or
A oLbrivial pah s Called
skarts and ords uith he 5arne verte
' a b e

Conecled graph

dioconnciad
NoTE )

is toly dscernccd.
2) Nall gaph
Galk vorlex and Cut edgc»
Acuk vertx Of a Coneci graph io a Weraz uhse
 matriz
is adjacency he
Vertice5. 4 ongraph complate a 16 ke
Monday
2012 19.03
n=4 ()
n-3 i) ifkyvertices
in diferenk
ewen
buo length cE
paths oumber the tnd )
Prcblams
gaph. dihe
sconnecks
al ther becau5c Cio Es, e, are cdaos cuk The
araph disconnccis
the Yoval
Vs, V, Va, are Vatices
Ve cut The
bncr becautse
Example
 Va Vg
A Mo 1

Gnd A A.A

3 2 2 2
2 3 2 2
2 2 3 2

2 2 2 3

3 2 2 2
2 32 2
2 32 I O
2 2 3

611 7
16 1
11 6 1
-1 1 1

A AA

617
16 11
 20 20 20
21
21 20 20
20
20 21 20
20
L20
20 20 21

The numbar paths of langth 2 bolwcen

bua kuo
Varlucs 5 3.

patho of length 3 bokwcen two

he numbor of
Vortuces A6 1.
dijferenk
lhz umber of Raths of lenqth beween different vertses
15 20

Euler and Hamilton Raths

Eulerian ürcuik (or) Eulerian cyle
Euwlerian Corcik (or Eulerian cycle)
a simpla cycle conkaurung ory cdqc of G.
Euler path»
Arn Euler path in a qraph 5 a simple path
Conkairing every dge of a.
Aconneced qraph G with ulerian cycle s called
Ealer graph or Eulerian qaph
Eq» b

C l0.
Tug

Gaph a, iaulerian becawse its Rosible to Rnd a

path abuegfcda bariung o eda cf 4, cxactiy
 Eulerian bocaus to

Selemine whether Euler path eaist n the foloung graphar

A
ái onkans actly kuo vartuces of odd dagre (a, b),
6 an Eulorian path abcdeb Starking wibh a and endang u
b. Theove ms )

LleY cle.
zulerian
gtaih has eracln 3 verlices odd dera, t has an
path.

6g onkans xacly kuo vertiss of add degra a, ), so here

aun Culerian path adca bo sarting with a and erdog win

Contains exactly buo verlices cf cdd degra (g, e), 6o ere

i6 an culerian path gabaffbcfede Starting with g and endng
witn c.
0.03 2012Thoorem : 1
A Corneced
Skatement graph a 5 culerian if and only

Lrtof have aven dav

at. let a be an culerian goph.

 dage.
prove Al vracas have eva Hoe, G is uran
10
culenan, a ontains
an culer crcuit (say heorem: 2
bunce a i6 stalemenkn

he qrapn ttn n vertes and k omponenb,

Both Ue cdocs and en Corntribuie dagre one to then he unber of edaes obngsk (n-6) (T.-kt )
io aeleast 2
dye of Ve and so degr of Vo
Th aang Us cycle, e fnd an cdgo ners a
verer mu.. ywen Sumple qrapn uith n Verticas and k
h
anoihar cdqe laaves the varte, ontributing tu to
dogre of the vortea. let te
munber of
pach verte is of
vertices of hese
This 5 rae for all vertices and 0 i ,Tk espectwey such thak , +Tst + T0
degr s, an even ntagg
V

90 the mauum umber

Va edgesn a
of edge6 15 yca
a p tt
i(n;-)
2

nin-)
let the qraph G be Guch that all bo vertias are of 2

21.6. 2012 Buk,

Wednesday
na á 5 Cornected and non_ivial, avoKa Vertox has adeast
s l i(, -1)
dãgra 2. las we have aumed all Vetas have even 2
cerae)
a Conkains a cule Z. If G consbts oforls this Cycys
bun & a obviousl culerian. Consider Ga Eern f all the remaining (k-1) compenernbo e
5uppose, 6claked Vertices, the muber of Vertics n G canok exceed
thoe 6 arothar
Cycle z uith a Vorez n con mon t t T-(k-1)n-kt1.
2. The alk. tang at t
conoisbung Z and
cycles

lE (a) 4 2 -k+) (nj -)

2
 (n,-1)
mkate
2

tnik-9])
y5ince
1 Tepeaks k
tmes
lE(a))< (1-k+) (n-*)
V
Hamiltorian Path
is Called a
A Simple path in a cornecked araph G
hanilanian path f at orkains every verte of a 2603202
soluion:
Cxacty rice. Monday
G1:
Hamiltomian ayclea In the gaph G1: Na Vgva VsVg YVe Vi is a hamilkonian
A smple cycle of a Connected graph a is called
cyce and So a is hamiltonian geph
hamiloniar aycle or hamillonian circuit if it conkains 1:ViVaVg VË Vg VgVNe is a hamillomian gap. pabh.
every vate of G exacty rce.

A Connecked qraph that contains a hamiltonian aydle In Ga afgbeheda is a hamlomian cycle and 0 as is
is called hamillonian graph. hamilkonian gph.
Example In azi afgbched i6 a hameltomian pah.
Tdentgy hamiltonan paths, hamiltonian cycles n the
follcuing graphs » V
in a, Ehere io o hamiton ccle, but there s a
hamiltomicn path VvaVg Va So lg is Tlok a harnilen graph.
 Honte, by Durac's etm, re
hamilton goph ha6 harmlzonirn Carcuuk
6 no houlkon ath and
n,tue ore's neoram

Sale pue heoram

wnth unber of Vertice veries, Say daglVs) t dug (Vs) 3+3 6
ASmple conectad graph
jor every vertez in
im>3 6 hamalkeniat, f dag (v) > Va =6, the condiacn hode
ORE'S theoTem degtVi) +dag (V3) 71 6 rue
Corunected.graph wnth unker
By ore's theorem, G has hamilkonian ürait
hamiltonian.
adacenk Verbices u and v, hon G 6
euleian
Test uhether Drac's theorem and oe's theorem can be
L5od to decide tat tho qven graphs has an hamiltorian a
Cucuit.

and hence G s a hamilkonian qph

Since the degree of each vertx s not even, it ts iOe
eulerian.

Gcln pics thaem:

) HWe an ezample Of a simple guph uhich s eulerian buk
There are Ge vertices, each of mot hamilkonian
degree 3.

dag (v) = (izl2,6)

dagtv) 2 saksfud. Since evoy vertez i6 oF even deara, a has an eularkan

cicuik. But, ik 5 not hamilkonian bucau6e can be saan
 evorty Veret tonkains
Contalning
that ovay cùcuit ts Eulerian.
hamillonian but
ot
4) Gve an exampe of a graph hich ie meither Eulerian

nalr hamilkonian.
Rkarsen aaph

The Peborson guh o not eulerian and not

hamiltonian.
|Sunce evey vertez io of odd degræ, the poterteen gaph ts
mob euleriant. It i5 a well -know fack that pakersen graph.
26 nok hamilkontan.