5.1. Graph Basics
5.1. Graph Basics
Groph Theory
Ler
V a, b, c, d f
a)
No loop
No mu hiple edges
No diractiom
Muti-avaph
bet" tuo nodes
Mu hiple edges
No loo
No cie chon
Psevdogreph/Unciecfed groph
- Auy Ithpe. odas
-Loop is alloded
No oirechon
Thocled raph
Direcked oces
Loop alloaded
d Mu Hple edges
Degree averlex
nomber - adges cohnecteed to a vertex.
The
e dogree oE
excep thaF a
Loof Coutrthutes tuwi cRto
loop
that vertey. That means, for a loop you have to count 2 degree
Loop
deg(a) = 2 4
) 2
deg () =
deg (c) =2
dag ( d ) 3
(o) 1
deg -
deg( ) - O
O
lsolaled verlex Verlex d1h darek.
is an isolated verlex
In G ver lex
Pendent means hanging from above
Vertex h degva 1, also called and
Pencdent verex:
In G verBex e penden vertex.
ver tex.
Notation dea ()
The total number of handshakes made by everyone (twice what each person does) is equal to the total number of handshakes that happen (number of edges).
In other words, for an undirected graph the sum of the degrees of all vertices is always twice the number of edges.
This might seem obvious for simple graphs, but it holds true for any complex undirected graph as well.
Lo,
Let = (v,E) be an Undiveched gvaph
do u) = Z degt(u) = E
uEV UEV
V Examples
2 xE = 60 ' l E =30
TEl= 24
deqvec. oeaeh vorlex = 4
vl ?
Using hanclshakiu +
v] 4 = 2x IE
v= 2x 24 = 12