MAth116Chapter5EulerCircuitsPart1BDone.notebook
Notation for graphs
This graph has six vertices A, B, C, D, E, and F and eight edges. The edges can be described by giving the two vertices that are connected by the edge. List all the edges: (as a pair of vertices)
Definitions and Terminology
Two vertices are said to be adjacent if The degree of a vertex is A path is a sequence of vertices with the property that each vertex in the sequence is adjacent to the next one. The key requirement in a path is that an edge can be part of a path only once.
A circuit is...
February 01, 2012
MAth116Chapter5EulerCircuitsPart1BDone.notebook
A graph is connected, if A graph that is not connected is said to be disconnected. A disconnected graph is made up of separate components.
Sometimes in a connected graph there is an edge such that if we were to erase it, the graph would become disconnected—such an edge is called a bridge. What edges are the bridges in this graph?
February 01, 2012
MAth116Chapter5EulerCircuitsPart1BDone.notebook
February 01, 2012
5­Room Puzzle: Is there a way to visit every room in this house without using the same door twice?
MAth116Chapter5EulerCircuitsPart1BDone.notebook
How is this a graph?
The question becomes....Can you visit every vertex without...
February 01, 2012
Attachments
Web Pages as Graphs
Euler Circuit TheHousesAndUtilitiesCrossingProblem.nbp