0 ratings0% found this document useful (0 votes) 272 views50 pagesGraph Theory Gold
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
Unit I
Unit 1
Unit Il
Unit IV
Gxup
GRAPH THEORY
Graphs, Sub graphs, some basic properties,
graphs, walks, trails, path & circuits, connected graphs, disconnected graphs and
Component, various operation on graphs. Euler graphs, Hamiltonian paths and
circuits, the traveling salesman problem, directed graphs, some types of directed
Braphs, directed paths and connectedness, Hamiltonian and Euler digraphs.
Trees and fundamental circuits, distance diameters, radius and pendent vertices,
rooted and binary trees, on counting trees; spanning trees, fundamental circuits,
finding all spanning trees of a graph and a weighted graph, trees with directed
edges, fundamental circuits in digraph, algorithms of Prim, Kruskal and Dijkstra.
Cuts sets and cut vertices, some properties, all cut sets in a graph, fundamental
circuits and cut sets, connectivity and separability, network flows, planer graphs,
Euler's formula and its corollaries, Kuratowski’s theorem and its application to
planarity detection of graphs, combinatorial and geometric dual, some more criterion
of planarity, thickness and crossings.
Incidence matrix of graph, sub matrices of A(G), circuit matrix, cut set matrix,
fundamental cireuit matrix and rank of B, path matrix and relationships among
B,& Cp adjacency matrices, adjacency matrix of a digraph, matrices A. B and ©
of digraphs, rank- nullity theorem, coloring and covering and partitioning of a graph,
chromatic number, chromatic Partitioning, chromatic polynomials, matching,
covering, enumeration, types of enumeration, counting of labeled and unlabeled trees,
various example of graphs & their subnt
inf
Qi. Whats Graph?
«linear grav (or simply a gaph) = (V8) consist ofa wt of objects 9 (ty tah
Suing verso sd annterset £=(E, By. B,jowhooe elements are called edges, such
‘Gut enck edge eye tdenied with ak unordered pair (0) of vertices
+ Bach slemont of called» certo node or point and each clement of scaled an
fig oe line or link
Foz,
Brame,
Inthe Fig. Vp Vas Vp VoD
B= ey 6965 Oe e669
2. Define the following terms.
‘Ane. Simple Graphs The graph tht has either contain ol hope nor parallel
‘called simple graph. Example, - a at__ B.TECH, — GRAPH THEORY
te — on
than tro cleo oniet BetWoen ey
tgs: 1 there are to. ot th 3
sed Capasso an paral edges, Exain®>
ret
Inthinfgrsejand gar the parleoess :
PSU Loop: tne edge whove slarting verins an ending vertex in seme in called
oop Essuiple Ta the gut ty and see owl op. Example,
“or
aos
Ed
crete esas enced aomi aie dial
nusiors of sden called «feito graph oborwie its called a infinite graph,
‘Brample, tn te figure, there are verticoand 0 ode.
19. & Ente Groh
‘Inthe igure, vertices and edges are coustable
TTY
cette
seosseecsmup sug TS
Speen eae —
ca ager na gee. oy tad
eo then vyand ¢are sad v0
imaidenc on vertu 0, Example
ctnoidance: When a vst oan end verte of ome
sen eaenete te tears eae am
Fo.0.
4. Adajacent edges: Two non-parallel edges areclledadjncent eg, if hey aro incident
ona common vertex Example
Fe 10.
sande; ar the adjnant Beanie they incident on a common verte
“Foro vertices ae alld adjacunt verter if there ie one e@ joining
aie stews
Adjacent verte
oYeeguy 2te
ving an incident edge i sllod an inclated vertex. The
in the Sgure, vertex ti. iaclated verte
ig.
10, Pendent Vertex: A vertex having degree one is known as pendent vertex
OF
Iie a vertox with ope edge incident on it In Uhe gure, vv, aro the pendent vertax.
segre of a nlated verte i
or A vortce heving sro dopeposta 8)
Pat
any edge called # Null 80. Tm oul gry
%
11, Nall Graphs A graph without
sett inan ated vere
i is Walt
een eq argh en tm Te HP NEON Bg
1,
deere af tiswreph =O
12 Order and Sine of Graph: Total numer of erties of graph Able te nay
foph Tats namberofadge fs grag cld the im of eeph Fanti,
x
Ky ite
“ %
ns &
Po.
4. Discuss various types of graphs?
Ans. Types of graph:
1. Simple graphs See Q 2)
Bea ultieraph: A pap having only parallel edges but no lop ia clled Mla
16.
4 Pini and infinite graph See Q 2
General graph A graph which omiains bob
raph Example, °
loops and parallol edges incaled general
-Teivat graphs A init graph with one vertxand nn edge izle the trival graph.
soe pinto knawa ag caval graph, Exannpley
G=
tod
17, Complete grap: A simple graph Oi wid o be complet ifevory vertex in Gisconnected
withesery ether vets Inthe words we can any thet complete graph contains exactly Ono
(ge berween each pair of distinct vortions. A complete graplia denoted by hy.
‘The graph fore 1,23, 4,5. Beample,
oA BS.
Fig. t8cH. — RAPA Er
vst —_——__
= Unt «1 — ere. — GRAPH THEORY
graph if ite all vertices nrg fy — ow == wre
enh Gina oe ep coed ear srk, —
ae Ene dares ofeach verece it S oy me
‘Rhuar op of deer Bo 2a
‘Sone tote about hecemaler geaph are missy savde-nods
Ti he vrowe ove thre ern = Be 300-4
‘uae Toeh roger grog of Bere 7 hans a
elas eran of dogree one has exactly one i. aes
ur Sy antes
hob ne
noe So total number of vorins 818
Fa. 18 ‘ae show that the ram ofthe degree ofall the vertices ina graph (is even equal to
se Biparsile Graphs A crop G= (V7, B)iraidtobe bipartite graph fit verte eanig :
_ ange Grats Near G3 1D ts parce aren An Simm uh den bts 8 denn eras Ale each de cones | ere
pruned inom abet Fos nt Tove etna Yanda dented by Hg) cohfthe vernon whith acon
Taso oo ie cuber of arte ned Ycepesioy. Ramee, "enon there areeediesin grab G the the total degre of the graph is oq 0 2e
‘Then, wana write it
ee Be= dy) + dlop ++ ato)
——
LL
Ye Be Samar
Lisi ‘Exampl
ak meat visconennen tneds tes
os pena wth wet OLDS coccinea
Sarre %
na
> ng HITE AHI=2dOI=BRaW—BAED=1
See) Hae) td) +d) +d Ge9t2t5+9+1= IBeveR Hence, proved.
(Q27. Show that the number of vortices of odd degree in « graph is alwaya even.
‘Ann We Law thatthe sm fhe dograce al verde ine grap ace he sab
‘edges in w graph (ie. a = herot
a
‘Thor, F anal gaph]
6, A graph Ghhas21 edgos, 8 vertices a Bare) = ae r
Qe Agra Chae edgn 8 verti f ogre and other vertices are of deer 3 o
Pes ee enteeor rete Seppo. nbe the od dgre verte in. Then equation) can bo exprened as
Seen of dese | $
dees dg (4) Se
a ime = 344942 Lanooy= Zeee or Z teow
Bus, we know by Hf and shaking lemmaTe
ng = erase EE
a Beez be oe {:Saerarea}
PI S avgte,) = 2e~ J des ey) even —even seven
(eee even},
stenc, the muse of vortices fod degre in a ereph Galore eves,
Example,
dug= 2,46) 8.4093.)
Sua vero of od degree = (03) + du) = 83 = 6 which i even
8. Waite any two applications of graph?
‘Aas. 1. Konigsberg Bridge Problems
The problem wes tetart at ony of the 4 land areas ofthe city A, B, Cor D walk
fk ofthe aoven bridges exact onee and return. to the starting point (wits
vimiming eres the rive,
“Mh erasers nd re th edge paca he
Fate peed oto of he rie Sa ora
* We Gnd that not al its vertious are ofthe even degree. Hence, it ix not an Wular grat
‘GE go rom to walkover ecko tne seven bridges exatly over and 1082
Fig 2,
[13] — UNIT - 1 — @:TECH, — GRAPH THEORY
2 Ualities Problem
+ There sto 8 houses Hy Hand Hy
Us Gae (Ch wad eletsidty (2) by means of cone, I i poet
awetion wits ay cromovor of io oondcts
each tbe connected toons afte ues war
a ‘ nle to make such
Fig 28.
+ igus shots ho this robles ea he rpseaested by a graph, The condition ae stows
(Exiipcehte tho howoe and stats supply ostren are vertices, Ae we can eat daw
in he plane without adgeecrosing ver Thus the answer to the problem does mot
a
*
se }
laa
rer.
(9, Show that slmple complete graph with nuverticas hax the
Ans. Spp0t® vy Ny ty Hy 88 the n-verties of graph,
Nom, Hdl) D+ D4 ot etyaS
= 2e=ate-D
on MED proved.
a 1 Explain with example?
ee rnoepbac graph, there i n2-ON8CoFre=ponigy,
oes ould be dontcl ropreeenttiontheirdoo
sw
pa > N.
10, Wat omen ea
ee tee praoe od Gy
‘eect ern and edger he
SSCS tr their ere mar bare
aio) 3
a)
a9
ay
dupes
“fore levels Exam
doy 3
28.
Fora graph tobe isomorphic they must have
tho same amber of wertess
1 the sume number of edges
1 the depo af vertex ehould be eae
.11. What ie sub graph? Also define its basic property.
‘Mos raph inca fa be the subgraph of «graph Oifall th vertices graph () and all ie
‘Geen gengh are in Gund each edge of has the sare end vertioos ingen grapb (0
secs subg
py SIL
Propertis : of subgrs ae
Fete samtrreereremerty
UASRSERIESN ee Ste uaa nate ner
gu tai deer agent ona
‘tna etn om Bonet ent nde
—~—_Ssts—~—~Ssé«
8)
Ss m2 >
GL S>
Fommncoese
ron.
eter jin superaph: To msgrnaond site eres dint sabrarh
ohare ema”
( pedd
\ + 2
ah st ps at
Se eer sti sdste
Tudge - No eepatetion
Vertions- Can be repontad
‘Open walk: Vg Vy Vaal Vs) Vy P¥znt0 show open wal.
Ph: Amal i which al the wertios are ditinct called path
OR
PATH io open whore starting and ending verusee ar diffrent.
Example,[16] — UNT -1— BER elt
= umn TeoH, — GRAPH THEORY
tr or tec — onary THEY _
‘a that graph a-¢,-b-ey-e-ty-b-egrd ia path, vertices are sar —
a en owed walk where tring and ending ee. Frcecieee nom marc
on eikessmrate scomensetse
: i nant eens sO
I ar Bs ie a ta Ba
fa/ DNS aioe . ate
LX) . yh => + le
Pg. 38 e “YY ¥
sniping re-send aetna y ns
pice Q ov
ee :
8 cece sony naman 0 nh oat yes we yn
aoe > min er aa ar
2 ns sa]
i = 608,
denied pede bcltSvemnit iene init _. 2
Samantenels te po eo '
ee hilt eerie Ton ‘>| 2p
(Cea ene eS
Somer eee : aa pe
‘Example, 3 a °
4. Ring sum: The ringaum of two erapha Gand Gy (written 8 G, © Gi 9 eraph
— omsting ofthe vertex et, gan of edgpa tha are either in oF but bot in
‘eh
O= G.OO= (Ue BU BY BOB)
cmt ougecesgsnwn Emote
(lv) Ever sh: ian <—
juler graph: A cloved walk running through every edge of G exactly ance is calle. 4 i “
alee and emp that consi tan Beltline inated an Euler raph ls Sco SS
mez eI
ot.
fachye te
‘Sur ct Dvd “ Pee
remipl ea fae Lat Cs
An Let Geant tt acho he Roamer C
teh emer
in or ie onan
2
enoe, [ws $m |acok daa
L$ nid =p Derm
yon SD = My DH iy Mey D
Flay tngtond Orbe d AD
th
Zeon
Savaring bt ls 0
an
fe, So) 2 (ate pone tome) 8+ ak
or S022 st aak
or Sas S1-2F ent 48 —ant
or Sab ek onset at an
Or Skee eal edo no
ae
Gye toe componsat of Gand
oui ogee in component enn not exceed #0,
[19] — UNMT - | — B.TECH, — GRAPH THEORY
on Saf en cate nbe naked ok
nob 1) HB)
Yb -n em bm eeD) @
Subettaing (2 i (1. we ent
Wea)
Honee » simple graph © with in vertices and k component can have at most
o-Bie—beD)
2
renin
(guts Prove hat gven connected granh isan Bule graph faa only fall vrtios
Yo aocicventtaree
See eee oe pur graph thant conto a urine (hich ia cloned
a er cy nati well macs sven gms rh
Tay Laeger cl one te sere oa wh hacer “cece” Tao
re ee pee rvs of eel oa of the tril wero, becntne
Soni citar che severe tthe tnpningsnd end ofthe walk reopocuvl
Fins Gisen toes gph te dope afore verter een
‘apres rcanyof ie condo cone tnt veto fa of nen degre
nog ee eraer at Sting in lry eee teed gna Eevegh atv oiee a
No S'Sarischaced mare thn coe ecco ning sito rb Sih every
“Snonicetorm luge, cat ut os very ote we entering canoe a ot 7
‘SnahutecAnd owe aooteren gis we shal sent rssh her he acing
‘ies onn onda ced welt hn ned nls he gen of wan Bet
trop fat we rameve on Gallthscdgeioh andahinins abgepl of fred the
‘notlageien Sybase h haves ir eso eves de, dopo ofthe
‘esinach Sur nuchiat asst serten inane Oiscmnared Staring Rone
SSnagin omnis sew oa naroph haseltie verte offen afevordepes is
Sin eu trminis teeta th wa in on bocomboed vi ha oea ne
‘whch errata wera vandes omcgthen ds Tcprees casero
Tulvecbisns sed well ntinweose aeipenste an Gina Bue enh
18. Prove chat a connected graph i an Euler graph i and only Ile can
compa tate cele;
‘Ans Suggs tap ean be dpe inci ht, inion of deine
‘ot Ginn the dope every veer n Cine Hee, as Baler gat
{raver teak Bar gph Gor» wrt hare es eat wo gee
ipsa ito tha esp ween ye ae aie a of eer
ro. we have anak acter dg, ny tsa shiv Proceing ths aco
ye evettally arto a veces that han povinely bo irneyiea thus fring eee
at wa seavefom @ All verse ie tnalang pepe tnot weseasely eee
stu ae be oven depo. Bi tne reineg eras Some anor oe ea[20] — unir -1— B.TECH — GREP
froin @. Connie tia procoes until no,
‘iri in wxaty the same way a we remaved from G. Con ad
ain pis with m vertices there are (8 12 edge ig.
Sins eesti ‘
aaa ae ess tantinn sree
‘eon ee enc teat eg
Sahai pei ac fas
EEowe a allows
if r
ap a —T
‘The subyraph fa cmpat gragh of ets) nig ea Halon crcl Roig
she re ae iy na he a pea crn. ns
260%. 00fa~ 1s, 2990 1) degree. Oserve tat oach rotation podunna
Manliness eat ts gs ncn any fh previous on, Tha, wa
{evap new Hamitonon cet all dpe dunt the ow 0 Fig acd ws egy Sin
Song theives
20, Define:
(0 Hamiltonian paths and cycles
(¢) Traveling talnemsan problem
Ans (0 asutonian Pathe and Ole
If has n vertices than ay hamtonian path must contain exactly (n~ 1) om
‘ite an umaloniaa pels mont contain evelyn edge. |
+ Havers in Ghas degree than shemilnian path wil contain atlenst one ade
almost edges incdenton Vy, while ahaatonsan eo has exacly 2 edges sda
‘Wilf vertex a dros 2 then bath vertices ncdent omit ut be na ham
path or cle
‘ool that doce not contain all the vertcodWhich ean be framed while bt
hnatnlan path or ee,
* nee a arsltonian cycle pases through a vertex Vall tho unused edge in ini
en sam be deleted cnc nly Bear incident on V than be ince ins hanna
9 Teavelling 8
‘nastoinn incite. The TSP in simple combinational prosems, Teewn be tated vor
‘A salman spend his time visiting cites er nodes) eycialy none our he vse?
“hom whe he nn pers
‘minimize the distance teveled ‘arte. In what order should he wath
21) — UT -1— seen. —GnapHTHeoRy
P q two city A and, tho distance from A to Ris he seme
J om Bi Innes go il ay he om rong ourovere te rer
‘Thisthey re voted str ra hed to dtinguish between tone anditeinveroe Ihre
‘retwo sles than the pesblom a teva Since onty one ours pomble forthe yanmetic ce
‘rere protic salon trivial all inke ve provnt then there are 1 dllevent te
nvesty aogiee TSP,
21. Show every bamionian graph in eonaeetde
GUN inconoccted and henee G.Visal sannected Hence © hn cut peta ind thus is
1.22. Adirocted complete graph always porsesres a hamiltonian path
‘Ans, Lt @ bo « compete grapiofm verucae then degre ofeach vertices of © most have
degov ny Latwand «be two vortices of, Therafre
dog rdoge=@ Dt
200)
2m)
raph with 7 vertices be somorphic to its compliment?
28. Can be
‘as. We have, not
“Acraph Gwithn verioseleamorphictoitacomplementofnorn—1isamultipleof4and
‘pumber of edges in O= numberof edges in M2)
n-1s7-180
{Neither 7 nor 03s a snlsple of 4. Honcw a graph cannot be isomorphic to ite complement
sith even eric
Q24, Lot G be n graph of m vortices than G has « Hamiltonian path of for any two
‘erties V, and ¥, of graph Othe
1+ dew van
‘Ans, he given problem to true ifthe graph O i connected graph. Lat ws rst we prove that
‘raph Gis connected
(ts the contrary, suppato G ie not conneted, Uti, thas tno (or mors) components,
‘Suppose Vis « vertex in one component which haa n, vertices and V, be the vertex im
spather component which has m, verien now degre of Vn, aad dogfe of Yang
deg V+ dog Vp= my tng 2 n= 1
‘Ths coutratiets our assumptions
once, Gis connected
‘The converte ofthe abow is not always chee that fs condition above is sufficient notNumber of vertices = 8
Degree afeach veiw
epee doge = &fornan adjacent vertcor ard ¥
pu, deg dog v=
Burthe:
ph ie Hamiltonian
Henee, he converse isnot re
(45. Explain tho following:
i Initint verter
(ii) eraninal vertex
(ie) Indegree
(6) Outdegree
‘i Aieected graph ora dageeph Gamat ast of votios
cfedges B= lee
‘eros
Example.
This is dingrph with seven
sm Ononted graph
Gy Te vero vy, which 9
icin were oy,
Os
ty oh a
Jrend a iepping 9 that maps an eg ont
a a3
ees nad five vertices. A ding ix luo eer
ges li Incident out of, called the initial vertex of 4*#!
~j—
mo ordered id
ECCS] =
(123) — Wer - | — B.TECH. — GRAPH THEORY
iy The vortex vj, which age oe in ineident ino, a called the terminal verton fey U4
Internal verte of
tiny The umber af edges ticket nto c clled the ineegree (or sn valence or inward
thomidoges) ao and in witen oe deg (0
0) Themuner cfedgentacident out ofa vert uj sscalled the out-degre Cor out-valencs
outward domidegreny of and witton dey! ()
426. Define watk, path and circuit.
Sox Walle A wallin a graph Ger finite wequence = He,
ca yeyen hone terre
Sa eae Bo edger euch that I< ie cage ¢ ne adv, wo ip The
lac nnddgoe ina walk are not necesnrly distinct, The qummberof edges in n walk the
‘Math of th walk Asal called ati] in which no edge is repeated.
‘Path: A walk in which al he vertiors are distinct i called a path
‘ChroutsAsloed watke.n walk between verlex and itaelf, sn which no egos ae repeated,
sealed a dest
() Connected graph
id) Disconnected graph
Gi) Components
fos,
1 Counooted Graph If there eat Inset on path betwen
tin Ge called x conaeted groph Sh telreen ey sir ofverises in ©
{Gi Disconnected Geaph: A graph which o nat connected ie called a disconnected graph,
{i Componente: A daconnored gregh cost two or ach
be ‘of these connected cubgeaphe ig called a component. carmen
Ob
Dacomaced gah win we creer
Fig. 48.ye Buler graph isand only ital yy
ph d
(25, Provo thata given connected graph Gis
of Goteven degree
‘Ane: Nocesuary Part: Suppose #
“Then Gemmaine a Buler ine (ehich is aclosed a)
cut (isan Baler graph
secs tener eee ta Pau
some enn taney neal ee
ace
See areas comet
far andinoy Vis also of even degree, when the tracing comes to an end, we shal ean
‘Sreafeven degree, thie walk ia 1; aust terminate ata’ but this walkin WF can be comtig
ete eee ene re
es
38, Let G be a graph, Verify that G has an Eulerian circuit.
oa.
‘An, We ere that connate degre ofa vedas even
es) = deo) = tg)
sa des a) doe) =8
‘Thun Ohaean Balen cel gen =o -
Q.20. Which of the following are Eulerian graphs?
(0 The compete graph
id) The graph of the octahedron
Ane
1 We know thatthe ar of ach verona ya
Age hah dear fahren yg ron ad i i a cone
Fig.
9 Inthe grap of oeteabodroan, each vertex
nected Thus the grep ie Ruler graph.
1. tet @ bea graph with n vertices which lt somorphic tits complement thon
ee Kian na isatviible by © {ure 21a
sar ad Lav ti 2 be fur parwice sje seta each of cardinality 1. Costret
frarh Gwith Wo)= Ul, Xi. EUG cosa cf the ees inthe two complete grape with vertex
SRL and 4 renpoclvely and the edge in the thre bictgues (ampeteBigrapbs) with
{Spaces ca a) CU) and OO; eepeciely Thea baste edge eo comping
‘aeiqein the tne complte ears wih verix in Rend 3 ceopeciely and he edges
{Relic bouts wih pardons G20, 44D and) eopectely. It almest
ines that 2 6
n= t+ i] Construct tho graph Goa tverin described above. Add a new verton re
iG ni it tigen hooreen ont evry member of, OS the reruting raph Cis ania
ssllconplementary.
(edt 2 rn = 4+ 3) The ttl number fees io Ky addin hi cae. So K, cannot
dectnyee ita a graph Gand ia complement @ with Go
82. Explain the operations of union, Intorsection and symmetric difference of two
simple graphs with an oxample for eack. TUTU 20721
‘Aus. Th disjoint union of graphs, sometimes referred to as simply graph union is dafined
‘3 bllowe. Fortwo grapha with dajlne vertex ecto Viand V2 (and hence dgjint edge wets
‘hee disjoint union i the graph U(VI U V2, £1 BD), It is a commutative and associatv
‘operation (or unlabeled graph).
‘The Intersection ia G1.n GB-= (V1 1 V2, E102) (olmple graph)
secnTRs ing ram G1 © C2 the vubernh of C1 @ C2 induced by the eg set i @ Fe
imple graph).ae: Oe.
—
‘Nous Ta et operon 9 te egies
pope 1-H eE-BD
Example:
ous, |e
Fg. 43.
2138, Define Bulerian and Hamiltonian graph. Draw a geaph with:
(@ Eulerian and Hamitonian
(G9 Balerian and Non-Hamiltonian
(i) Hamiltonian and non-Eulerian
(Ge) Non.Bulerian and Nos-Hanaltonlan
furu22)
\ns, Ulevian Graph: A graph P= (V,H) is called Bulerian if there ia circuit in Pika
aes rough every verter v= V and thet traverses every edge of Pexaetly one.
Hamiltonian Graph: G = (V, B) be « graph, A Hamiltonian eivouit te « circuit whi
sateimagh ey vere acy one (ih oly and lt vex olga
Soba asonaa iipanae near et
Fam
‘Ths graph iy BOTH Fulerian and Haniltoninan,
B.TECH, — GRAPH THEORY
Fa. st.
‘ths graph is Rleran, bot NOT Tailonian
Fig.
‘this graph ie an Hamiltonian, but NOT Eulerian,
Fig. 53
‘Tis raph is NEITHER Polevian NOR Hamiltonian.
(84. Esplain the concept of Lisomorphism and 24somorphism wry 2013
See romorphiam, Suppose Gand Gyre groups. We sty that Gand Gyave Lisomorphic
{2thorsexnsea Lisomorphiam tefroen G, end Gy‘, « Lhomomorphiom of groups from Gy
‘5.6, whose invero in ele ishotiomorphism. In othr words, there ia aBjection between Gy
Soa Gy whoo resiton fo any eylsabgroup on iter sein a morph ots image
‘Jromorphism:Suppoee G, and Gare groups We ay thst Gand Gare 2isomoephic
Ushers erste 2 eomorpbiera Usbween'G, snd Gy Le, aZ-homomorphism of groupe om Gy
oO, whove inverse ia alta -omomorphiem. In other wort, the is two fection between
6, end G, whose tation € any eylie subgroup cn ether ede is an isomorphiosm to its
‘nee
goo{20} UNIT =~ TECH. — GRAPH THEORY
pt
ri i.
Ky
“qa topan he re Also lo down he property of aranh( With rn ws f
aaa eset ia det ai
Rated Tan A ee dtd nih vrs ell
an ee
ie
TAN x *
~ Fig.
‘roe with one to, tes, four and five verties repectively re shown in gure,
ima
SRSA LEANER snencnt eet ta linge
crn (9 euy tm md Compton nay rs
1 There ene and only one path between every par of vortiona ina iste (1. Binary sree: A toe in which thee is exactly one vertex of degree two and each ofthe
eee eeet ne aoe soi Ftc has
pene remot
peepee Zam
SR hin ancannamcncomnll Ne
= . .
snmp annie NWS
— L
a corusn 7 ®
uy nd nine mos
Dees Complete binary tree: A comple Binary tree is a tn
Qpaaeis cna al aan it eat etme ooh Lh
‘Ams, (} Pendent Vertex: A vertex of degree one in a tres Tiscallad a Pendant vertex 099 Example,
ore ermal ods all sar wep ss rial ern ae Sede!
‘vertices or branch node. ‘iaciianin ee
Example: Vertios 2, 6, n, ae pedent vortex.
Fos.
28B.TECH, — GRAPH THESE
: yeaah veron mabe 7
__ Geers Facade eta
shew woo af V ae root is called the subtree of V.
va be (oy sabree a
(oy rae ety
Fa.
(©) Spanning Tree
dace Thich na eubgraph of «connected graph G= (Y, 8 lled a spanning ine?
coninin all the vertice of
aaa ana tice nt ia feo from cxeit. Hence, a circuitlns connected aubraph Pes
raph'Slna spanning ree of GT contains al the vertices of
‘eeample: Spanning tee of Peterson graph.
8. Define directed tro
‘Ans. A direclad tee in an acgli diagraph which has one nade cule its oot with inde)
‘Tile all other nodes have indegee I very directed tcee must ave at Toast one se
lated node I alo a directed treo,
Example,
LA Pot ae
Se
“ope
{a1} — UNIT - 1 8.ECH, — GRAPH THEORY
Qa. Prove that every vortex ina directed tree difforent from the root has wis
Pau be a vertex ina directed tee since i not the rot. There must be a vertex fo
Me directed edge of oy via aot unique, let V be another vertex such that ©
a te 2 tn the remover of ur wil ct dlaconnéet the graph because it contra
creeemlin othe wee shere cannot exit another vertex vy euch that vg ie directed we
once the unigue paren fy
(QS. Prove that in « non-trivial tree T there are atleast two pendent vertices
Fae root Lat Thea aon-trvial ice with nvorbiny, then total degree of Tin given by t
ferme
Sareiop = ne ‘
av tn tty av = ei in et
Suet
‘Now, et us samume that there is ualy one vertex ay V, of degree one iT: je only o
pondant vertex.
in)
we Stesia = deetar+ Save
Saceep = 1+ $ cosy)
Since, Tie a nontrivial eo so deg @)) 22 for alle, {223 7
‘Thea from equation @) and (3)
aire 1+ F doen)
Zoey = 20-3 «
Since, dog 22
= Sacwys2e-n
Hone, 2n—22 20-2
‘hich in not pombe,
‘Therefore, in tee T, there are a laut two pendat vertices
QS. Consider a troo T with vortices of degree, 4 vertices of degree 3, and 3
‘tdegeee 4 Calculate the aaber af pendant vordaes ina tceete ms TN
‘Ant. Let tho numberof pendent vertices inate bem. Then — :
“otal munber of vertices in tree
Tem rd +4+3=(10+m)82) — UNIT - I — B.TECH. — GRAPH THEORY
mre)
‘wal amber a dgee = (10-+ =) =
Sime, Sodew ey) = 20
one thore are 12 pondont vortices in the given trae 7.
1 Draw the spanning tree of the following.
Fia.8,
{() Iti graph Gthore is one and only one path between every pair of vertices, G
latree, «UTU-20%2;
(Gi) A connected graph with n-vertices and (n— 1) edges ina treBeet —— GRAPE TEES oe numa iale OSS
poor [95] — UNrT- B.TECH. — GRAPH THEORY.
= Uae = esrecnt — anarn rior
inconsced then Gn oe Now lt amare catch ren
ens Qiong hore a ext at eo Ap no pr te ah Ginna he Ga te Neo tare tat th
roof Supper Git etjcesin . New onpposs that bro vers Gand bof au Gvemcoanected ont hay eempooens Lat Cy Ca Ose pore en Ge
Le herp pe wil emars erat tnd cama sees eek comPene
Se cntaicton Reno prove ™ eh
ae Tan rae the hore sone and ono petubetmetsvrerypg| er number day
Newent in ae Date betaoen nvbry pair of vertiow af C.graph Gent bbtshdeteh
SINE canescens ap os tit he ls _
ce ay pail vores, tert rae od only om pth he epIsHIe. Rite arestel
Anes Eta: Now Gin cooncted and haa nocroit Galore Giese. (balsbal+—~ b-€ )
(Go EEE Condes acct of ng btn G. here aro Kevertes ad oda ori
aoe ene romsning fn) vrtin tone cre Bathe taal ea a
i) Proof Suppose Gita
GesG2n we k=n meee Dunchgwens emteadcion Ans ie donclit lore edi
(9. Prove that treo with nvortious han exactly (x= 1) edge ne, woke nt
Sec Prout po tinocea by ndeaton tot om the member certen oti Tce, the mumor of sapenest i Oe one arene Gace
Tent sh eras. £12. Datoe pendant vertius ina tree. Prove CA the namber of pendant verti
ttn, thre ny ene ede connecting wo verte, (21), hanes the heen ons
tne fraetandn Ina binary ree with n-vertons ie "2
Sie mn it sor oe rl ee eres ‘Ans, Pondant vortices: Pesdant vor is a wert with dogeee exe, Here, 6, and ¢ are
4 | A pendant vertoos 7
a. tt. cS
Letanasppaaea tree with avers Iwedelate an edge eth 7, we find two cmponent oy
‘wcnise ia Prthee ie one and al one path between every pair of vertices, Sze = !m Soe
amgononis have fewer than m-verias by induction aeewmpion. oech somponant cuts
‘ne esc edge than the numberof vrees ni, Therefore bath the component contains (2)
tees end it we add the removing edge than has exacti 1) edges,
‘Wie know, that tial mumbar of es in etre er (4 ~ 1 o, total dogro a tho trea ie
10, Prove that any tcee T with n (n2 2) vertions has atleast two pendont vertC® gion by a ey
‘Ans. Proof Lot be the number afgendontvertioee inte T, chon remaining in) ei
Proof Lat qe the sumer of pendant vertices a's binary tee 7. Then ng Lie the
| suntor of verttes of gros thro.
Fe rain Steet) xine
Seoeapem sam Lytae-g_ne2=2q-9
sect no eh tse wh nen ha en fete ahs
ae, DEBE irenen
ae arom
So, ony tee Twith n vertices hen atlest 2 pent vortins,
1 Show hata genph O wth n-verticor and (m1) edges and without ciel eaegaa ae A ad (7) = unr w=
nsocinted with tee Ua
(18. Define the following terms . conte of
{@) Distance :
(@) Bocenricity 610 « {bee minimum ecstity
fo) Contre
() Radius tere, re vortion¢ and d avg minimum eccentricity‘ Hence, thi tres hes 0
{@) Diameter conser nt verter cand
iy Ditance: Ina connected erp the ditance betwee 10 VEC and ng we we an on we 7™
i 0) ie defined :
+ acne ofthe shortest path berscen ad te
ime fedavs the eortent path etwou 04 % &
ieoctabeeste ieee ee (4) Mads: The eccontricity ofthe centre baw ae incall he radi of the re.
lon he-f-ne-k-jd-a-h~ jlete anole
thre tsonly one shorter path Le, adie leah i one
ene, the distance dio.) = 1 20,
ft
oe ote
a Sow
ig. 18
‘The mlaimum eccentricity atthe point j= 3. then the radius of the tree =3.
(©) Diameter: Tho longest path a tre is called the diameter ofthe see. Or we cam sy
Fi. 18. ‘he maximum eocentricty of vere in re (7) alld th dameter ofthe toe
(6) “Beventeicity"s The ecenticiy ofa vortx V, denoted a8 BU) is the distenes tus) Example:
to the ferhac vortx (in graph (G) thats
\ oon ogy oe
sponte ioe way de
TT i id ll a me
See ee pin ha
woe ow |U. Show that every tree has either one or two centres. futu 20121
a ae) na. A conte ina tee is a vertex with minimum ecevatristy and eccentricity isthe maximus
~ stance of that vert from anyother votox ofthe tee. Soin tree maximum distance betwoen
& ry
ferx and e bend (ov) oosure only when ei pendant verte.
Now let urtake a trae T with toc more then two pendant vertices ad fellow the process
Fig 14 1. Remave all the pendant vertices from tree To form a graph T! whichis tila toe,
Beoxnirinty at point a= 4. Vertex ds having minimum ecoentriity Le. 2
(e) Centre: A vertex having simu eccen 5
Sentra having trocty ie called the centre ofthe gro
maximum cocntrcty = 5.sey — user = sina
Tp Pan Pyare pea vest -
1 SEE hemes of enc vertex Tad 7
Pa
= an
ote am et co
Sa ‘ie en
Fg 18
recanbeoborved thet he ema ofpandeat erin te Tecra he exes
sa pene hy one funder vera in TRAS cee
ttn eso Pin
4 Ronen che proces af removed of pendant vertices uni there i eft elther avrg
Rapes theca fre Foran cdg, whore tersna vertices ae he (no oni
Teno paved the hoor.
(0. Weite tne short note on elven ew
{o) On counting trees
(@) Labelled graph
(6) Fandamental circuit
oR
mncept of fandamentalcireultin a direct graph. {UTU ahi
‘Ans. (2) On counting treon The problem of ooentingtrce wae dacoverod by Artis 8
In lor, while he wes tying to count the-umbors of strucaced ieomers of the ears
Fpdrwcnrbons Coss fastener was the rut wo disvared trees dering this p08
He repreented the Cy molculo by using a cmnected graph in which a carbon 92
‘wae ropresented by verter of degree j and a hydrogen atom by a vertex of degroe ond,
So. the total amber of vere in such «grep is
na mein $2= im
ese ne dg nm dion
1
= Jam +100 +2
one2
Since, the gruph is conseoted e
verti, the graph form ina ree.
nd the number of edges i one leas than the aun
ene een re aren
96] — uni =u —
(@) Labelled graph: A gra in which eich vortex assigned @ unig label er name ia
cash waa eng
TABS
Pig. 0.
“The above figure thow the tee diferent able raph, When we are counting Une muse
opaifecent grape, we ore counting the labelled graph.
(@ Fundamental eizeuit: Let G be @ connected graph and Tbe is spanning tre. A
-drout formed Bp adding a ehord to epanning woe T, call afundarmental eee
oan Sowee
Po 21
‘The graph showe a spanning tee T= (A, B,C, D, Bae dg ofthe graph G.
"The chord st with reapec to apanning tree 7 i
c= eet A)
‘The fundamental creuite with seepect othe chord set are given below in tho Fig. 22.
Pondamental cute formed by adding chord be, fan tose pansing tee Trogpectvely
We have seen tht four fendamonial circuits with respec o four chords
£0 isa connoctd of e odgea and r vertion end T is @ epanming tee of G with (n —
‘rane, then there is exacdy (e~ n+ 1) chords in G with respect to 7. Henoe, en D
‘ndomaneal ceive, with reapect ta Tin G.Fe
(10. The number of labelled treen with n-verticlas when m 22 ie nt-#,
‘atimportnt |
‘Ana Thi theorem wa ie started and proved by cavley and hence calle! cashes tere
‘Thediterent tee forn= 3 vercce are shown infu. The total mumiber a fore aba
teenth n= areracerie
State Reni Nal
‘Ana Let Ghen graph with verter. e
‘bers can be derived frm these
Fewpectvely and Jefe
ra Yea k
snd nity
spr
‘led vank and nally
149) — UNAT - — @.TECH. — GRAPH THEORY
fumer of ranches ina panning tee of
tyws eons t= Number af corde in
Tak + ally» += ial umber fete
14 Diecut problem ofcountag teen
Stin tur Aur Cay Scr te eh wasn i sing tpi of
Me eee eenl eine a eee eas
Seetlemh ocr te Gils cadens wteeraan cement e
Scimed ere Gevead striate tre tee otter wae boesor ered
Seep ita chown vices Te cea embed rensincoc gst
SE0 Tend lat manker ofedgs gon bp
cE ommetteone)= Ene rnen
Bn
Since the graphs comeced andthe number of gm one) with m vertices tin
sc Thun tt poem of cumin race monet oft re paren cans the
fiom af puting ten. Fi tres sae pone Scns toe nee OF
Epes tus ier uelnd tes thawte ok eet
is. Define span
Siabaingere’
on
Define Spanning tree and minimum spanning tree ofa graph. (UTU 2013],
‘Ans. Ifa te Tis a aubgragh of «connected graph G and Tcontaine al vertices of G then it
‘ido be spanning tree f «connected igh
‘Minium spanning tree: If tee Tia sub graph ofa concocted graph such that tae
minimum number of edges required frit tahe ceanecied Teen called min
= \ me.
Pom,
Since the vertios of Garo barly hanging together in epansing tre itcan be considered
‘so the oracinal graph G. Therefore. a spanning tv sometimes teerred to sua skeleton
oF eafeling ofay — veer —.
ph We shape hat Ga at enone sping re.
ate ke ac Me chan area delete aes om te eT
Sense ung cn or eon a
Eee 2 eng erg
-. wruse:
622. Dioure the envi santa ob ,
ae ig slogan problem (TSP) = 2p NE-hant problem # combina,
aa ene a recta tpn rans atk 2 the shag
cn es ache encom a urna 6 Se orgs 1 ea
Seek twelng purawr prin
“pcm ts moved aot tndseted weighed graph sch haath py
certs pu isthe graph ean ad's pats duane te the edges length
“Stinuali polo seing wading epesed wert ter having sod ent
aNTrener cacy once. Ofe, he madel'a compte graph ech puto vere
ittectdby and) foot ea beecn tre Sten nobng an asta lo od wi
‘Sule the gral without afleting te etna tor.
— saree. — on
—a owe
Fig. 28,
(31, Montion the difference between Prings algorithm aud Krushal's algosichm fo
{nding the minimom spanning ree mith the help of an example. [UTU 2011
Ans, Incamputer asencn Prime algoriet isan algerithn tha nd a ninyn spon
{mor a connesed weighted untried graph Thismouns I: Onde a aubace of he eget
Sona ste that includes every vortex, who te ol waghe fall the edges 1a the ee |
‘ninimaed. Prin’ algorithm sv an exnpl of grey agithen
—
143] — Ur - i — B.TECH — GRAPH THEORY
Examples
e1@
bak
eaten 113.8)
Mating U=1.5.84) Yann. 01.86.42
Fig 23.
[Kruskal Algorivinn,ia directly basod on 2hereneric MST algorithm. Ie builde the MST
ooh verve isin iowa een fret, Then, algrichm considers each edge
‘ntarn, order by ineracting weight Fan go (0) connec two diferent tre, thon (te) 6
‘21 othe sot of edges of MST, atv trees connected by sn edge (xv) are merged into ®
Single tre om the other hand, famedge a, eonuoctetwo Vertes into seme tee, then edge
(ib i dieseded.
4 lle mone formally, given #coenecied, undirected, weighted graph with a fonction
wiBaR
+ Stare with each vertex bing its own component
+ Repeatedly sieges to componsata int one choosing tho Light edge that connected
‘ham (i, the ight edge coslng the eu between the.
+ Scans thee of edges in manotonicaly increasing order by weight.
+ Usen a dsjintaet data suractre to determine whether an edge codnecte vortices in
Aliffeeat components? ____ £45] — UNIT - I — B.TECH. — GRAPH THEORY,
4: Inala pointy queue G8. @— MG
4, While prity queue Gis st emp do
1h we Bons, in (1 Pll oot new verte,
6. Se Su lal Perform relaxation french were austment it
7, Boreach veetox Vin Ail) de
& Relax 2,0)
Seep 1, Given ital gah G=(V, 2, Al aades have efi cost except the sure node,
sion nas Oat
‘Wo pet the dack edges sown inte abe sre, ioe
ge ele wT oT
age ef ai
ago eee 2
Hlge 2) eet
age) fo
ge):
god) =k
age ha) eae
‘Step 2. hes we chow tho nod, which closet 0 che gouee node, « We ntitia ds} to
Sener o.addieie Rela all nna adjacent taaoite,e Update predecessor (ee sow in diagram
age re) rect ae 8 Rela lt ode
age ae iow) fr all odes dat
relate bude « minima
‘ine. The boat line slays th short (inte
{oighd ONLY ft dove NOT eete x eyele
a's bade minim panning tee by ang one vortex ttm. The nea aren
‘waded is ava the one ronest oa verix leaty on te graph
(22, Weite Dihstra's algorithm fo fading the ehartest distance. Explain with tit
Telp ofan oxample Toru zi
‘Ans Diata's algorithenis graph rec clgorich that solves the single-soure ahs! 7 7
‘eth pecle fora groph with now ops eee path ees producing m shorter path te Step 3. Chooge he eloreat nee, x Rola ll nodoe adjacent to node Updte predaoessors
is loca neon ueed in eouting ada {hr nods wand agaia notice avvownin dag below)
ye uc vertex Gods) th eape * = “
ire ose ayant
raid ess oct
rather tae oven moe
Algorithm: DISKSTRA (G, w, s) ”
Sin Sea
© SCAMS it eet ct era ashen pth eights fom &(46) — UN
ode nadie Retxaode 30d
ne
‘emp 4 Now nae athe ee
Cchaoe this node and adjust ite neigh
‘seep 8. Now, we have node u tha into
Step 6, Fly a nade The pedeceatr list now dofinos the ehorlatt pst fom
de tthe sours 8
’
(q1. Beplain the followings
“oy Cuvsets
(©) Fandamental cat ots
‘Ane, (a) Cutoots: Ina eensected graph G:a sut-oot is aot of egos together with their ond
‘frst wave rameval from 6, lovos Gdisonnecd, provided removal of wo proper subect
WTihecs edges dincnecta @
on
In other words “In a nected graph isn sat of edges whose removal from @ leaves @
dixonnected™
‘hseet altage cute” © graph ate evo. Therefore, a cutect can also be defined as &
naa se f ego ine sonnected graph whose vemoved redueca the rank of te graph by
‘exemple:
‘Cutsot: Removal of eueset fo, cd, from graph (4, the graph is
Let Gb aconnected graph and Tbs aspanning tee in G.The euteet Ce in that contains
‘sme one branch ofthe epaaaing tre (1) alled tho Fundamental eutoot with reapect to 7.
”Fo.
tn he shove graph ee spanning tne TBld Bins) and allthe five cuss with eset
Tue with sport ey Ca Hy
ovate wah epee ney Cop= e920
Gea ith pet 0g Can fe 0)
(Casts with ropes ey Cpe= 09)
acta epee to C= ey 6)
2 Prove hatin a connected geaph G any mnimal set of edges contsining tas
Sec beanch of every spanning ree of Glow onto
Sinn Print Lx 0 urs Contacte soph ond tho isa ef edge conning a
‘aclaunchefevery panning on enthe eval fron (2, sho graph Gein
‘Dpoming woe fC Hance Gin Genoese. Alto et Sth nial tua oon wht
‘aul autos be graph cena on eng st ny ogy e from #to G-S wile
{cero apenning teh Ge sbgraph = Sotto by nin of gy fom
‘S"bcomeciad lene nt Sth minal nto edge containing at oat one Brena ef 3
(93.trove that every cutee ine connected graph Gimust contain atlonstone rss
‘stevery spanning oe
‘ans Lt OCB) nw conaected gregh and = (Vp By) be apaoning treo Lat
tka caret C= Vp 2) dont me hove any olge aman with tee
1 Wy Bete,
Eynk, =¢
Se thermos of Com Gwin ot dot sgt PO
ecabtbasamem fC Alnsnnat the graph becoute panning
‘Spansing wee ite conesed
connected graph
Shacbgph = Cemtaoing tc i
mn RMR Contain te Piel oe Tin inp tat Cie
"Heer every cutee ane
‘:aph G met contain atigat ong beach f°
a
“poo tne every crate hasan even number tegen common with 29
ca proves ence
set ae econiter cotta eri Gan Ch ci
aa Ee rep e cist mame coaponaae a
6 ed in gt outs Vy and Ygten Vn Ya 8
ee oe Gace earch ts tert nt Vox etx nV
Se er cr eccates tn ee Gries MS Bp ee an e™
sere ey gi cl kata cero
Se ee Glan nV, an ene erm of Cyt art Vtbon m4
2 oe hemcan ean re encay tn one Gy ©
————
tia G. Thon the emovsl
Wi enon the vortex set V
Ca
erwin
Fig. 3.
So, the nuaber of age trvare in this poctes bettecn the vertecacts Van Yganuae be
ves toms we kao that a cis chai in natare: And every edge in the eutaot C, has
SSeapitrcnd vecten in Wad othor nV, and no char odgo of @ can partition the verlk wot
Vor Gist sajint ste V; and Vy
Honse, (8, 98) ~ even uanber that ix the number of dges cmon to cut set C, and
rca Gye ove
6, Find the cutaet inthe graph 6 given in igure.
Fe
Ans the very frat cutant se, tho cng edge
‘oo,
Fosle
ee)
a= tose ed :
9 = He ty ed
Fo.
GAGE Be ey ene
—_—
Fat,
-
SS
3 ¥
ren
gancynbvtnened .
4
6G Geto 04
~
Fie 2.
(C9 = Heo te 09
ig. 14
ea ne ring em
ae cata
Seer,
oom
| LR a a casio aeration On ninbt
‘lien tho eration cuties in over wore, eige connestty af connected graph Gia the
Seen ger erase gear onsiron fs
iL —F915
Lethe given graph there are eevencutet. Lik
swan
Te sir ruber
SH anecsiiy The vertex commana onset eat Cdn
ib Nees Comme Te en lesen EN ad
‘Beample: Tee example an (and ven below
e010, DED WME Aha
tegeein a cobectar thre Hence, the eds connecting
® ® ©
Fete
In ace) the vertex connectivity of the graph are Two means vertex (V's V)_#*
dale tne rete Vyand Vy then the graph diaconscted. Tn example) the vertex
the gag one means vertex 7)
Tn example verten onnecinty = on8, vertex (3.
(©) Separable Graph: A connected graph @ wth vertex connectivity ‘ONE sl
separate graph and the vertex connetvy mare thin one the graph ie called nom-e=
{20} — UNIT - @ — B.TECH, — GRAPH THEORY
example:
Fg
‘The above graph is separable graph because removing the vertex (@) th
simone
(7. Explain the following torms:
(@ Flow
(@) Network flow
‘Ana. (o) Flow: Aflow fn graph Gia a positive real valued function defined on each edge
tip) seh
x
Os 1,9 Sep0)
ieee tha cacy eth de hati walang any ee dosnt eid the
apucty o that odgs.
2 Ercuny= Ere)
[For ach vertex 6 any internal vortex Le, i neither source nor snk ia graph G.
‘Thin property indicator that at each snteraal vertex or node, he total Fate of commodity
‘entering i equal tothe total tate of commodity Tearing
for any edge (incident fom the unk or incident tothe aouree.
setwok ia weightod directed graph G= (V, B) which aataios the
fatowing
1A network ew na network which has one and only one vertex source (8) that has 9
incoming edge Tt has one and ony one sink CZ or destination verton
2. Weight ofeach edge in eal postive number.
Exampleoun ne
ag) un
a
TECH
pret
athe fos of 084
ow jon and slzo define its expaclty-
Fo ork thn eperaues the SOY a
sie pm ofthe edges THI Cu ta dag
comer containing E00 ng
‘Te ove gap repre
eutact in a Neto
verwark Flow: cu
Shomer by avidin t
gare ee two partion of
61.) where Nand,
especialy
Fg. 1.
te the sbove graph the eu-et represents the edge (dh f) whieh ix separnted fm
sours Stan Dh “
peat ofthe neworkThecapasy of thine XX) denoted by CO, ite
ss the sum of tho eapacito ofall the edges (ouch thate, EX andond v « X.
foam = OMe
jaun= 3
‘That
8. Ta the given graph, find all the out-tets that soparates source from snk. Al
‘Bad out the cut at wich minimum capacity.
y
‘rhe eutsots are
£195] — UNFT - Ml — B.TECH. — GRAPH THEORY
‘then CUA, (2.66 DY= Ce,0)+ Ct, 6)
=6r5=1
Capacity of second cutset
Cis, 0, 8A. {DD = (b. D)+ (C.D)
=8s3=n1
Similarly, capacity of 9 cuter:
‘Gie,a,€). (6. D)= Cha, 8) + Oe,
548619
ty ial ealeulabed then the two minimum eapacity = 11 A
Silay the other ea
10, Calculate the maximum possible increase in the flow argumonted path gi
blows
Pig. 22.
Ans Since, y= min (Cl He) FU HD
hore dae, og) im forward direction
ial . ,= min (6-9, 0-9, C-3)
t
‘Le ue assume d, is the minimum of flow in backward direction.
3 ‘ty win (0), fo =3
‘Thon the possible increase flow d = min (2,
seit ening Tun ef fred si an orig wnt Row in bac
mn the new maximum fw ie:
a
eo) al— BTEC
a 197) — wer
PLANAR GRAPHS }
complete
09h,
"
S.TEOM, — GRAPH THEORY
searple. Also peove that
aqri.nenne ho sane rt nih® :
oe ere i syoro exist vomo BwOrziC pose N
ere eng oe
foe ag Cre a eseparaneitcme A cit / \
cae ; \
See ghar nolaare ;
Soma : (/ \
‘Now have to deaw an edge bobwoon verter ¢ a ban ad without intense
J
/
(0) Non sna rap
(01 Para Gm
Fa 2h.
roa The complet raph ve ves cans (is
sot embedded plane
Seer a umeleconseted pragh whieh ie completed dhe every vertex Is amed
ona ee retes with sa edge So wo mua ave a eet of -vertans | ( |
A a
| Onna des enna ye dt
Sie, the ph ee
so ity tm ah come vere tb contd wth vere de
Tevactae. yb drawn ie the pentagon witha inertia
Jays napa bec———— prec. — GRAPH TES ~~
pn -ur
ron
eta
Ty apenas Wa fae Kuso gph nla
= sar ew 2 Sagiph Sentai nye Ramm gagh tee Os oe
eo then itshows at i non-plansr graph, 4. Both tho graph Mend yy are regular raphe
‘The dove graph interest Ue eda 4K, (Kuratowakis first graph) is non-planar with the amallest number of vertices.
ine Planar Graphe? caine geometric ropresentation of the graph 5. Ky, {Rraratouaki' is aocond grap) isthe non planar graph with the emalloe! number
fe Agr Oar ls rs eencane Bum ots
snore ao
| qa. What ic Rogion and its Degree?
_—
1. The planar representation of graph a divides the plane of paper into several eegions
alo called faces or mete,
2. The degsee of any rgion sy R denoted a as deg Ui the length of the closed walle
which bounds the rion Exaile
'.
ce Ne seg) =6
deg) =3
4 agit)
rn aout
5 Is
Fe. 28,
18. Define Luratowsli's two nonplaner graphs?
Deaw the two Kuratowski
weaphs. a
‘Ans. The first Kuratourai's raph is complete graph of S-vertices (ty) and th!
‘Koraawokss graph in vogular amniced yaph of vertices and nine edgoe 3)"