Graph theory Flashcards
adjacent
two vertices connected by and edge
incident
the edge e=(y,v) is incident with u and v
handshaking theorem undirected
2E = sum(degrees of v)
handshaking theorem Directed graphs
E= degree outv = degree inv
chromatic number of Kn
complete n
chromatic number of Cn
circle 3 odd, 2 even
Wn chromatic
wheel 3 odd 4 even
Sn
star graphs 2
Bipartite
iff vertices of G can be colored by 2 or fewer colors
iff every circuit has even length
Euler circuit
a simple circuit containing every edge of G
Euler Path
a simple path containing every edge of G
how to tell if it has a Euler circuit
Every vertex must have an even degree
how to tell if it has a Euler path
has exactly 2 vertices of odd degree rest must be even
Hamiltonian circuit
a circuit covering each vertex exactly once
Planar
can be drawn in the plane without crossing edges