Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Graph Theory

Download as pdf or txt
Download as pdf or txt
You are on page 1of 23

Graph ,

vertices , edges degree


, ,
multiple edges
T

edges which
end on it

loops , simple graph ,


directed
graph/digraph)
walks , path cycles
, ,
Eulerian

, Hamelttoman
awry edge
vertice
every
connected , disconnected ,
planar graph ,
watere set ,

mossing
famil things creat
no
can

edge
- car
be written as a union
disconnected
=
tow
if edge wtV
v is adjacent

isolated vertic
degree O->
related verter
degree 1-> single 211 =11
undirected graph =Ev deg(i)
=

u
lama
handshaking
GIV , E-E) E'cE Ge vv6/e make v
Subgraph
=

v
e=
=

matri incidence matric


vertices vs edges
adjancy ,

all possible edgy


P Complete graphs
graph . = =

Null
↑A7
/N]
vertices degree
Graph (n) : all 2
cycle
Path Graphs Pr= (n-Eeig
all vertices
Wheel Graph Wn] Regular Graph
same
, ,

degree)
White-Black vertices) Complete Biparit
Biparite Graph ,

graph/Rus)
K-cube/Op join
all
,
nodes
differing by one-bits
* * "

vertices , R2
↳ 2
edges
GrV -)
Complement
V, E kn
=

initial vertor ,
final
verter
length (no of edgest
.

walk : ,

↳ all distinct : trail all vertices edges distinct


edges ,
set path
edge =>

closed
first & last same -
length) cycle

connected : there is a
path from every vertex

another vector
to
The in Biparite Graph is
of even
length
cycle
vertices medges
This components ,
n ,

)
/
-

n -
k = m
u

removal makes set connected set discon


disconnecting set:
subt Hatst e

outset odisconnectingsetwith a opendisconnecting


,

Ee}
-

bridge
set vertices & corresponding edge whose removal
separating set:makes ofset disconnected
,
if no
vertices-I vecuturte

: /6)
I smallest
separating set
cardinality
connectivity ↳
Kappa
Graph Theory
: Giv , -> ordered pair
finite
deal with
graph
->

->
vertices
+
Edges /2 subset
of v)
simple (no multiple edges & loops)
->


edge with
starting &
O
enden
pseudograph
-> same
q

multigraph
->

digraph /directed grap h)


->
->
subset
becomes
ordered
pair

->

Adjacency -> order : /VI =


n

ne > V E> EuvIEE


EU VIRE
->
size (E) - m

EAVES

neighbourhood
,

->
uouxxv3 N[v] NM) = 343
N()
=
=

=
d(v)
It is invident
-> Incidence : e-edge
v, ECE) to v

vertis
Spectral Graph Theory

complement : 6: V , E) ,
5 : N , e)
E I'partion all
,
possible
I subset
of V

Isomorphism : 6 /
6 .
there must be a

, ~ve) beection between


v, v

↑ s .
t .

a bE)
-(a)q(b)

Eric
3)
X
--
Use
smallestquith
5 ↳
rength of ye it

PETERSEN GRAPH
= is an
equivalence relation
? Cs
Cyceraph
~>
viam conjecture
Reconstruction
conjecture : subgraph
H = 6

vertic deted
subgraph
6-EV =

/V-Ev} ,
E- [1 u) ,
:
(
,
u)Ez

Sequence & Sets : / E)


Degree 6 =
,
degree sequence

degree sequence

Pseg
Sequence

Sa ,,..
-9an3X
condition
veassary aien-1
·

21 Sa ,
=

2(E(62)
=zm

odd vertices
coary : I even
of
, O2-1 ....
an

Havel-Hakimi : Ed , ......, dn] I


graphic E Edz- ......, dddd-z dn} ....

graphic
is

trivial
I : E

miflangest
drvi) > dNVj)
evil

--- as drvi) <drvj)


there is such a
so

v----VR
neighbour

Von
↓ ↳ switch
V,

->
=
no
degree changes
!
-

VR
vi

Berge/1972) 6
6ydeg
6
dey seq6'
=

,
seq
G'can be obtained
from 6
=>

using
of swiths
a
sequence

/Prove
using Induction)
Erdi's & Galla /1960) Try it

Ed , dr .... dn34 graphic ExCdi1


* dikrb-)
i= 1
-

Eminfact
Degree Sets : Distinct
Degree
set integers does I graph
ofSets
a
Given a ve ,

UK ,
6 with degre ? Yes ⑭
it S

order o no ofvertee
1977) :
Least Order
/Kapoor ,
Polimem , Wall ,

S =

Sa ,
. . -

-, 9n}
maxS
1/3) =
1 +

P
forder ·By Induction

possible sesorder
2) All

3) min Singe
Connectedness :

path
: no vertoc repeated
walk : no
respriction
trails no
edge repeated
all trails are walks
trails
all paths are

last vertic
cycle
:
wath with
first
repeated

with vertices
path
a
Pr :
any fall isomorphic

In with vertices
any cycle fall isomorphic

walk
a ,
v are connected by
a

then there is a
path
between them

Prove ?

called component
~maximal connected subgraphs cannot add

so that it remains
a verter more
connected
components of 6
/07 : number
of
Gorder= n

k
/6) components
=

c =
#

size In-R Prove 8

Traversibility :
contains all edges
·
Eulerian trails trail which
-

closed extrian trails exterion trail


·

first
last vertices are same

Hrivial component : component


no
edge
with
FvEC
Theorem :
-
G /ulrian) E) d(V) is even
↳ connected
↳ connecte d
-

=>
trivial
E

dr
Lemma 8/6)= min
1(G) d)
ma
=
-(6)
I
z=> shas a
cycle
definite
then S/6)= /I
&I
Ok if k <7
kx 2)
py Prove
C
construction)
7

approach
it is
regular
of 6 is I ,

Prove that
union
of cycle
construction approach)
Induct on E size
6-E()
remain even
degrees eulerian
are
& E so
they

OD
SemiEulerian vertices odd
Graph' 2 are

to construct
add edge
eulerian graph ot
& then remove ,

Hamiltonian's Theorem's

=> /613) =
15) k(sV(6)
·ve theorm-
smakels
theorem
3(6) = f7
Hameltonian : spanning cycle
necessary
6 is Hameltoian=> </61S) = (S1 +d=S= 6

O O

0
C
00
⑧ O
Hameltonian ric
S


~
C, -> 3

0
,
0

es · so injective
-

/1960)
Sufficiency ORE's
: theorem

dra)= div)
= v
n= 3 -

EYV then 6
Whenever ,

is Hameltonian

MOC 6 -> X Hameltonian

WL06 ,
6 is maximal ladding any edge
16 =
u - v makes it hamiltonian

"Hane
a cannot be connected to vi& u cannot

be connected
to viel
else it is hameltonian

-
-
-
S= Ei : uz
Trixi
T=

2i8v> ,3 v

(SUTI-1S1T) =

151 It
n
A SUT

150+1 <n-1

=>
Isnt1> 1
=G
-> E

coary' sufficiency =3 & /6) *

Hameltonian closure" /6)


6 isH Ex C1(6) is H

- Induction

Tree
·
connected , acyclic
Lamaw iT tree , 27/
has at least two leaves /degree-1)
macimal path)
i +'Tre
+leaf=
TFAE :
any
two
of
· connected

acyclic
·

on - m
=

comprise a tree

·
!u-v path F Ev

connected
minimally
·

movimally acyclic
C-A = Induction
armousof
there is
node
leaf
of degree
a

I so remove it
&
by induction
tree add
basically
a
so

a node

A + D x
=

take approach
forest
D A MOL
doc +
=

sosuppose
a
cycle
&
remove edge an you
to-
remo stell get a
connected & number
of
is -2
edges
-> t

Ed(V) /n - 1)
Properties
2
:
=

vot

converse

I tree with
a
degseg Id dry
,.....

whenever 5 di=2n-2

Induction

gtrees'

of ren-2
Total no · labeled trees
In) = -1
-

Cn-1
=In-3
-1
degree sequences
n - 2

Total= R
Samma I
(a , -1
,
. . .

du)
=(a
- .., C
dirz ; dur

=E..... diz !
...
da

-Jan ) E
die

I
Extremal
Graph theory Ramsey Theory
,

theorem :
Konig's odd
·
bipartite Ex G has
no
cycle
has must be
even
any d cycle
->

E fix
v =

[xEV/6) : dri v)
,
odd3
2 =

[xEV/0)82/dr )} ,

-"
even
- odd
A odd
length cycle
eyen
y

Colouring
f v(6) (4)
: -

·
Vertos
Acolouring
proper coloring (( -

=> f(u)=f()

number X/6) : minimum number


chromatic
colours
of
&
Edge Map
·

dique : W(b) /Largest complete


subgraph)
-1, -

dique ( = 3

X(6) = wo)
: two vertices
Independence # no are
·

adjacent largest
possible)
xro)
os

# Partistpon
be e
oncolour

has macimum

2/6) elements

Greedy algorithm
8 V
, Ve , ....., Un
- not
gives approximation
exact number colour
one
by one
by
Theorem 8 X(6) [ =

1567 smallest no .

-
GE know Lodd
with equality iff

↳ prove
for others decrease

using greedy algorithm


by

has v , un in
better ve ...,

way
deceasing order
of diy
↑(6) ! = mac/min [i di3) ,

1 in

/6 R) Vol- [m]
, :
#off =

↳ chromatic function/polynomial)
Whitney (1931)
mk" 1ecb
-

? k -. --

↑ (6 ,
k) =
kn -

R
Recurrence Lemma :

/En , k) =
b

/kn ,
k) =

(k) n
-
x(Tn k) ,
=

k(k 1)-

also imply back


we can show there is one

components
& is the
no .

oft component
which divides
larges power
k

6 . e=>
contraction

Use Induction
to prove whitney
x(6 k)
,
=

x(6 -
e, b) - x16 e-k) .

I
↓ ↓
all possible subtract
the case

where
they
the
are
same

:
For
edge coloring
116) <chromaticity = 1- (6)

be
converting
Map coloring
can

to verte colourable

You might also like