0% found this document useful (0 votes)
90 views8 pagesGraph Theory - 1
basics of graphs ans properties
Uploaded by
SANJAY OLICopyright
© © 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
0% found this document useful (0 votes)
90 views8 pagesGraph Theory - 1
basics of graphs ans properties
Uploaded by
SANJAY OLICopyright
© © 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
/ 8
‘Questions
1. | Define with an example
i) Directed Graph ii) Multi graph ii) Complete bipartite graph Iv) Degree of vertex
v) Isolated vertex 0
2. | Explain a Regular graph with example. Show that in a graph the number of vertices of
odd degree is even.
3, [Define with an example Pendant vertex. IG is a graph with m - vertices and m-edges| 10
let 6 Be the minimum and A be the maximal local degrees, then prove that
os 3, there are (n ~ 1)/2 edge disjoint Hamilton
cycles.
8. | Define @ connected and disconnected graphs with example. Prove that connected | 10
graph with n vertices has least (n 1) edges.
40. | Define a Planar graph. Show that in any connected planar graph with n - vertices and | 10
m- edges has exactly (m —n + 2) regions (Euler's formula).
Ti. | Define Chromatic number. Prove that a graph of order n = 2 consisting of a single | 10
circuit is 2 chromatic, ifn is even and 3 chromatic ifn is odd.
12. | Define a tree and binary tree. prove that tree n vertices has exactly (n.— 1) edges 10
13. | Define matching, complete matching, cut set and cut vertex of a graph. Give one | 10
example for each.
14. | Define the following with example: i) Binary Tree il) Balanced Tree i) Rooted trees | 10
iv) Full binary tree _v) Spanning tree
15. | Define @ minimal spanning tree. Explain Kruskal’s algorithm for finding a minimum | 2
spanning tree of a graph. +
L-U) Divected Grafh. Adicceted floph ov a defeph
is @ fav LV,E)_ there Vis a montnbhy et ahd
iS @ vet of evdeved “pairs f alleneuts takin fren
He act V. (vie), ;
Foy 0 divected 9vt f elowauts uf Vave culled verti
banks oy nodes cud He sbiuents of © ave called
Civectad 2dyes. Te tet Vis called d4, vertex get
Oud ret © ix called the divectod adge sof
BaF) Pte dineled reff Aaa
ue . vevtox Aet i's V={A,6,¢ Dd}
Gnd He tdee sete E> LAG cb, CA}
diy 4 &
Here vartersch (6 iAauee Ln V- {464i
ek but adge aet es dif
frat, Hotes
E> S Aw AC CHS
» dott He divected grepl rebraented J
4 Sh
tess hot ave Aale- ‘ A b ‘. 6s ae %
2
& A a
Sim ale S\oh f, ukhigvebh o
hg
Crerered Swope,
Heve ave tree Here, 81,95 04 Hove e, ye) 0, fe
i, Ove td 90g and ' ae
TS by 2, anda Ac, eu 25 Gud 2p avy adses,
ANd VoBus AC, Ove Ves, “ud A&C aud b
Edge ey and eg
Ara verted, Bdge Oe
Save sane eid And &y aro pa edges
Verkus Band ¢ And adse C4 Start tied
Tis callled frre Dol fdees tid WU Adee wep
bibs celled Leap,
Ovder and Size) The wurbee f verhirs Uy & Stapf,
MS calld He order of tte qeBt. aud He nuenley of.
edges in its called ths ize,
Bhartite hiebh A smble jebh Gr ig Ane Hab tty
Vertex at V is the Union of two minhre lly dis fot
nemo hy att Vy Id Vy whee ave auch Hy
Uh G& gOns a vertex th V, aud a
ris culled & bipartite
’ aa ey)
WHEE tne suck tat lin Viand Vs ave a petit
( ra dex UAV) end Va (Wy Gy Cabs
th ts afau yf 4 ver! ) F
mee: fot Pane tuo vetiuy Jott 4 whict are i Vorb
Ths this graph rs abibarthte graph with Vir $A,BChaw
W229 P,Q,R5% os bibvhtos
blake 1 peitihe nth > A Libarhite gum
GV ME) 1s colled & comblte be parkihe
NObL TE tive is as adge otwert, poe verte» tq
Vy and avery verter Cy V.
The eraiable tH be bake Sropf, rs not a Complote
bibavbte yap, docaute How ee, 2d4qo Fantg Acad
GS) Band P, bard Q 1 4nd 6
7 Phd Cand Raid Cand p
A Complete bibarbte Pepk Ga lyyy JE) vy whied
He biavbhtos Vy) Aud Vr Comtaly \- Ghd S verhvos
Nerpotk vdly pw yo ¢ 7S denoted 4y Kys.
Taths graph, cack of Y verhius ty Via
Foined ty cacy
of & verbs ty Vo ; 5 Rowell A " 1 Tf Ge WE) de a peph Gnd we
| Degree of Virtox : Td
de & verter ef Gy. Teh, tHe numhey | |
GSH. Fo offer verhees with He Loops Cornted tarie
ts callod dto dope of vertex ye dnd denoted ty du).
oS
diwJ=3, dU) 24 dias
di%y)23
wy wD
Tsofeted Varkx 1 4 Vertex Uh a graph whit is
HOt an end vertex of any edge of He arabb is called
Qh (sollatod veiter. Thus, @ vertex is an Usobated
Verte » t and only Uf ths dapree i's eyo,
Ea ai $s culled Peudat vertex,
V4 And Vy are isolated ver hley
hy
«| oX,, "Va And Wy aud ave pendent verti. RT AE Raley Crabh ar
P ALY))> aft) > dL Pd (Mg Jad
Pat ME
Aa
B-Cosulhy brnph (luke WA ’
AUS) 3U,)=d (v5 )» “88>
ALG) edits) 2d (U,) ‘
DUB, ) ed lV) >0 (i) wy Ve
AL%) > 3
4 PayMay Arvabt vy
AW )ad LV) -dL¥ ad yy
= A
Ba
Cmadey a svabh with n-vordius , Leb Seppare tat
ot dlage vevhings ave of odd degvee “Ap fla} Yebnodbaes
(>-k) worbus ave of even dogvers Tf Vy VL
Ave vovlus with odd dogver and te? ng — ly
| apevtuy With evn deve “Then He sun 4tte de
be of the verhus ts :
y : k
Bee Sc (i) sauteed iy
“ Plo, tits au. 'S cbs oven. Therefve “He Tt ruin 14 the
Lorohonl ) wird aby Io ove hy Hot Ch
dF) pou 4 dl.) > 2en — @)
But ancl of cleve,) 7 dls, ) — 1d, ) ts bdo. There fore
Te Maker sf tomas Te Ae LHS th 2G natn (L) wast
bo ae aa hiner
Ans-3 Pandas Vowhae de Giant ty Antiuer=2
Lit dy dr, Ax, —ch, J, the desven of the verbo
Tew) by 1 srrover, cf Sub h teow
Amin fF dogvesss = 2X humbav op edgar
ditditdy¢ ——d,> am, he modges,
, CG
Smu Sein Gd diy dy, —— jn) Hen we Pave
a\Z5, d, 23,4325, — sduzs.
Adding tase thegittiy , we obfn'n
atdydiy+ - —+a, bean tt Ce
Simi aly, Sine A> hoy (4udayds, ——ucly) ten
4, $8 jd, od, vd,
