Chapter 11
Basics of Graph Theory
Summary.
graphs are defined by sets, not by diagrams
deleting a vertex or edge
how to use proofs by induction on graphs
Euler's handshaking lemma
graph invariants, distinguishing between graphs
labeled and unlabeled graphs
random graphs
-
Important definitions:
graph, vertex, edge
loop, multiple edge, multigraph, simple graph
endvertex, incident, adjacent, neighbour
degree, valency, isolated vertex
subgraph, induced subgraph
complete graph, complement of a graph
isomorphic graphs, isomorphism between graphs
-
Notation:
u∼v
uv
val(v), deg(v), d(v), dG(v)
G∖{v}, G∖{e}
Kn,Gc
G1≅G2