Scribd
Upload
7 views

3.4 Connected Graphs Notes

Uploaded by

elwynholley
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

3.4 Connected Graphs Notes

Uploaded by

elwynholley
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Connected Graphs

Types of Connected Graphs


Walk – is a way for us to move along a graph, using the edges to go from vertex to vertex.
On a walk, we are allowed to repeat edges and vertices as often as we like. When there is no
ambiguity, we can represent a walk with a sequence of labelled vertices.

Trail – A trail is a walk where the edges are distinct. That is, the edges may not be repeated
on the walk. Vertices are allowed to be repeated.

Path – A path is a trail where no vertices are repeated. Repeating an edge would require that
a vertex is repeated. Therefore, a path has no repeated vertices or edges.
Cycle – A cycle is a path in which the beginning vertex is the same as the end vertex, and no
vertex or edge is repeated. The starting vertex may be repeated to complete the cycle.

Circuit - A circuit is a trail in which the beginning vertex is the same as the end vertex, and
where no edge is repeated.

Traversable graphs
1. A traversable graph has a trail that includes every edge
2. For a graph to be traversable it Must be connected
3. Connected graphs are traversable if:
• All vertices are even
• exactly two vertices are odd and the rest are even
4. A graph with more than 2 odd vertices is not traversable
5. A graph that is traversable will have a either a eulerian trail or a eulerian circuit that
involves the use of every edge in the graph
Eulerian trails and circuits
 An eulerian trail is a trail that includes every edge in a graph. The graph must have
exactly two odd degrees

 An eulerian circuit is a circuit that includes every edge in a graph. The graph must
have all even degree vertices.
Hamiltonian paths and cycles
 A Hamiltonian path passes through every vertex of a connected graph. It may or
may not involve all of the edges.

• A Hamiltonian cycle is a Hamiltonian path that starts and finishes at the same vertex.
• The existence of Hamiltonian paths and cycles can only be determined by trial and
error

You might also like