Graph Theory

Notes

Definitions

Graph G = (V,E) (ordered pair of sets) V Vertices E Edges Edge u is a neighbor of edge v if they are connected by an edge N(v) (open) neighborhood of v := { in V ! a neighbor of v" N#v$ c%osed neighborhood of v := N(v) &nion {v" is

Definitions (contin&ed)

'roper edge (oins t o distinct vertices )e%f*%oop (oins a verte+ to itse%f ,&%ti*Edge {edges in E : have the sa-e endpoints v" (Edge -&%tip%icity := !,&%ti*Edge!) )i-p%e graph graph itho&t se%f*%oops or -&%ti*edges itho&t %oops .oop*%ess graph graph

(Genera%) graph the -ost genera% for- of a graph Trivia% graph graph consisting of (&st a sing%e verte+ N&%% graph G = (E-pty set, E-pty set)

Definitions (contin&ed)

Digraph a graph here a%% edges have directions Tai%(edge) Edge(edge) here the edge starts frohere the edge is directed to

,i+ed graph a graph that has both directed and &ndirected edges /nder%ying graph the graph that is obtained by re-oving a%% the directions fro- a digraph

0or-a% )pecification of a si-p%e graph

1d(acency tab%e

': 2 3 ) 2: ' ) 3: ' ) ): ' 2 3

The graph is specified by a ro for each verte+ and a its neighbors (separated by a co%on)

0or-a% )pecification of a genera% graph

G = (V, E, Endpts) Endpts : E 4 V + V

Endpts(a) = (&,&) Endpts(b) = (&,&) Endpts(c) = (&,v) Endpts(d) = ( ,&) 5 The set (tab%e) repr6 of Endpts is ca%%ed an incidence tab%e

0or-a% )pecification of a genera% digraph or -i+ed graph

D = (V, E, Endpts, 7ead, Tai%) 7ead : E 4 V (ta8es an edge and o&tp&ts its head) Tai%: E 4 V (******************** and o&tp&ts its tai%) 9e get a representation of a -i+ed graph if e restrict the 7ead and Tai% f&nctions to a proper s&bset of E (the edges that are directed)6

Definition (contin&ed)

1d(acent vertices neighbor vertices 1d(acent edges t o edges (oined by a verte+ :ncident to (edge;verte+) verte+ that is an endpoint of an edge is incident to it Deg : V 4 Z+

Deg(a) = !{proper edges incident to a"! <

=!{se%f*%oops"!

Degree se>&ence: a se>&ence of degrees of the vertices in non increasing order, e6g6 {?, ?, @, A, A, B"

'rops6 ; Theore-s

)i-p%e (Non*trivia%) graphs have at %east one pair of vertices ith the sa-e degree6 (proof: BC=deg(v)C=n*A6 DanEt have a verte+ of deg6 B and another one of deg6 n*A so at %east one pair of vertices has the sa-e degree6) Euler Degree-Sum Theorem: deg(vertices) = 2*|E|. (proof: Each edge adds = to the tota% degree s&-, one for each verte+ it connectsF the se%f %oops add = to the degree as e%%6) Doro%%ary: The n&-ber of vertices of odd degree is even

Donstr&ct a graph fro- degree se>&ence

V = {n iso%ated vertices" Dra e6 e;= se%f*%oops on the ones ith even degree

Dra (o*A);= se%f*%oops on the ones ith odd degree o6 (9e are -issing a sing%e degree on each of these)6 )ince there are an even n&-ber of odd deg6 Vertices, pair the- &p and have an edge connect each pair, giving a tota% of o degree6

Graphic se>&ences

1 se>&ence hich hen per-&ted prod&ces a degree se>&ence of a si-p%e graph6 This si-p%e graph is said to rea%iGe the se>&ence6