Reading material
Pages 360-361 (Section 8.5), pages 538-543 (Section 12.1)
Additional material
A simple cycle is a path
-
of which the first and last vertex are the same,
-
all other vertices are different, and
-
which has at least three different vertices.
A cycle is a path
-
of which the first and last vertex are the same and
-
which contains a simple cycle.
Proof of Proposition 12.11 in
PostScript and
PDF
Vertex
Edge
SimpleGraph
Question
Consider the following simple undirected graph.
-
What are the endpoints of edge a?
-
Are the vertices 1 and 3 adjacent?
-
Is the edge c incident on 2?
-
What is the degree of 2?
-
Does the graph contain simple cycles? If so, give one.
-
Does the graph contain cycles that are not simple? If so, give one.