The degree of a vertex deg v is the number

of edges in G that are incident to V

a
l
c
deg a
2
b I 1
of deg a

3
deg a

Theorem In an undirected graph

dega HEI
VE V
e
Base case El O.IE ldeg 0,2
DE
I H Graph G
Add edge I
case 1 Loop
Weleave a vertex and comeback to the
vertex t 2 degrees

case 2 connecting Vi with y where i j

A graph is in regular if deg v L for all v EV

3 regular graph
degli 3 b
 o.O
Is it possible to have a 5 Regular graph with 10 edges

degas 21El
u
v 4
T of

degas 5 I 2
5 2 3
s 6 qq
µg 4 7 degl4 g
igfa
8 10

Hypercubes Qn

Q Q Q
0
Hoo
to do
10 1
I l l
o
A N ooo
00 01 000 001
duplicateand
connect

Show that there mustbe an even number of odd degree

vertices in any undirected graph G CV E
 EU 9

Assume odd number of odd degree vertices

2kt t 2L 2m
2jtl
T odd T T
4 deg deg
odd remaining

4kjtzktzjtlt2L
2 212kjtktj.tl
tl 2 m
odd even