voph bep K.

Arion kumar
Ass:nnent - t BO9acsENOIO05 66-

Owrte short
a note en

a Garaph
A groph is delned as the ordered Pair
pair a Se
vertices and a. sel edges G (v.¬)

Heve, v is the sekveptices and E is the set

edges connectna the verices

In his graph, E

verices v
fAB.C,D, E}
Edges E
A8, AC, 8D, CD, DE
b) Regular Grraph

A groph in which degree all he verices is Same

called as a regular graph.

T a l l Ehe verices in a graph are degree 'k, Hhen

s Called as a "k-reqular graph.
In hese grophs,

AM he verlices have
degree-3
They aegular qraphs.
are

)Degree Verlex
The degree o o Vertex is he numer edges
Conneciing i
 In his undirccted Caraph,
*deg(a) a,as there are a
edges meeting at verx a
deg (b) 3, as heve are 3 edges meeing
at verlex '6'.

*deg(c) t, as there is edge formed at

vertex 'e'. 3o, c is a Pendent
vertex
*deg(a)a,as there are 2edges meeling at Vevbex 'd'.
** deg (e) a
deg(e) -0,. as
as heye are oedges ormed at verter'e'. so,e
s an iSolated vertex.

aComplebe Cnraph
A graph n hich exoctl one
edge is present
betwecn every pair verices is ca lad as a
Complete
9raph.
A CompleLe graph 'nVertices Contains exactly nc,
edges.
* AComplele graph verices s Tepresenbed as kn.
n hese grophs, each vertex is
Connected wrh all the remnaining

The
Verlices hough exactly ene

Ore
cdge.
Complete graphs
A
 e) Bpadte Cwaph
A brparite graph i3 a graph where
yertices Can be divided into sebs xand Y
The Verlices ch sebx onb join with
the Uerlices set Y.
None the ertites belongna toto
he Same 9e join each other
find the degree d vertex VVa.V3 Vu .

The degrece Verte , is

deg (v. ) 4
The degree Vertex v s ey e
deg (va) 4

The degree evertex v is

deg tva) =4
The degee eertex
V s
deg (vu)3
Rrove that the sun he degresall
alverices in a
Gaph G is tustce the number d edges in G.
we to be
asSume n
num ber edges in a
graph &(6
| E ,, has no edges exst, So all nodes in have
degree 0.
n 2 *0 £ deg (v) :o
ASSue U.(n is true, we need lo show that vi(n+i) is
also rue, that is
ant) Edeg (v)
VEV
 I n a 9raph with number edges n+1. T e
renove ene edges at random G, e get a subgrapr
C(E'v') for which we can assume U«(n)
an Edeg (v)
ev'
Ga is equal the
to subgraph G plus edge. AS one
ever edge con ributes Lo he tokal number degrees
we Can
say orG
an+ a (n+) E deg (v)
, (n+)
Pove thab the nurmber verlices odd degree in an
undirecter graph is aluays euen.

Leb a be a
graph rth e
edges and n vertïces U,
Va,V3 .,Vn
Each edge is ncidert en tso vedices, ?t contributes
a to he Surn e degree Uertices in
graph .
then
then bhe
the Sum degrees all vertices n i s tustce
he number edges in G.

deg Cy:)ae
Le the degrees irst"vertices be even and
an
he Yemaining (n-) vertices have eds degrees ,then

deg (ur)- deg (ur)+deg (u:)

deg (vr)+ ~ deg ()

deg (v:) s even
 But, or i r*l, Ti3,..,neach d (u:) is odd.so, He
umber
tems in deg (ut) must be even
0S0
Cn-)S even. r+I

btain the adjacenc matrtx or he follousing 3g raph.

raph .

es e
V
O

Va O eu

es
V3 O e

Vu
e
V5 O

eain the inciden.ce matrix or heolloust ng graph

h

V2

O
Eyplatn konigsbera bridge problem.
Euler (120-178a) becane the aher vaph heor as
ell as
topologz when in 936 he Seltled a famous
LunSolved problem his da called he "Konigsberg
Bridge'
Problem. there were two slands linked to each oher
and
and to the
anks he Pregel River by seven
as ahousn.he Problem
brdges
four
land
as bo begin at any he
areas, tialk across each
and retun to he bridge exactly once
starling Potne.
*The DasiG
basig combi natorial nature
a clue to isLide gvaph heor and
words aplkcab: bby are indtcaked in the
ane
sylvesber, The theor
k

Yamiication s
Pture
colltgatüon, for takes no accoLunt d
magnibde pos:lion geomebrical lnes are used,
ar

hawe no more rea

bearing on the matler hanbub hose
employed in genialegica tables have in
aws Procreation". explaintng the

D
A

Seve this Problem empirically, but all

must be
attempls
unsuccessJul, for he tremendous conbr:bution
Euler in his Case was
negative.
En Proung that he Problem is unsoluable,
Euler replace each land area by a Potnt and each
each
 brdge by Pstnt and each bridge by line Joiningte
a
a

Comespondtng Points, Thereby Producing a "graph". The afh

Shouan, shere the Poinbs are labelled to correspond to
he
our dand areas shousing that he Problem
unsohuble is egulualent to shousing Hat the qraph
be bransUered n a came
certain a
Ratner than ereaing this
SPec:tc srtuation, Euler
generalteed the Problem and developed a erikertan
iven graph tobe So Jor
&ora
a

Connected and every traversable,

Poinb
is
namely that it is
,

Point incident
incident tstth
oth an an ever
r h on even rumber
ohile Ene graph
whtle o nes.
incident r h an Connecked,ne every PaTnt
fornt 1s
1s
even number
nes

wnte a
short note on
a)walk

b) wakis defined fnite lengh allernabing

as a

Seguence Uertices and edges.

The total no.e edges coverad n a
walk is calted
walk called
as
length he alk.
NOTE Uertices and
edges Can be repeated.
tabc,e,d ( Zength =4)
+
db.a,c.e ,d, e, ( Length *)
c

e,cob,a, c,e,d (Zength 6)

 b) Trail
In graph heor, a brail is delined as an open
wak in ohich verlizes may vepeat .But edges are n
aloued bo repeat.
c) Path
A Path is delined as an open ak in which,
Neither Verlices dre allowed to repeat , Ner édges are
allowed torepeat.
d Ctrcuit
Tn graph heoraj, a circust is defined as a closed
dalk in htch verlices may refeat .Bubt edges are net
allowed repeak.
e Cycle
In graph heora, a yele is delned as a closed alk
in which- Nerher verüces are allowed to rePeat Vor
edges are allowed to repea
Euler Cirauit and check ushether he
Define follos'ng araph
iEuler Qraph o n
V

eo
e
e

An euler Circutt is a
Circui hot tises
ses ver edge
a
gaph with no repeats. Being inin
a
and end at he
circuit, it must stort
same vertex.
The gven gure is Eler Circuit
T haS edges in each vertex
6 s v v eqLV esv, ea_v C6 v v,
Deftne gtamlbanonion cycle and eheck whether he
ollosing graph is Hom:lbonian graph net

AHaniltonian Circuit that bisis ever vertex nte

oith no repeats. Being a circutt,?} must start and
end at he same Uerlex.

riven gure is nob haniltonian Circui because

it repeats the vertex mare han nce So, it . is net
Poss:ble t Hamr)tonan circutt.