KIN 2500 Chapter : Ch06
15 Mar 2019
School
Course
Professor
Document Summary
Graph- a finite set of dots and connecting lengths. Loop- an edge that starts and edns at the same vertex. Degree- the number of edges that meet at a vertex. Even vertex- a vertex whose degree is even. Odd vertex- a vertex whose degree is odd. Adjacent vertices- two vertices connected by an edge: when you draw a graph, the placement of the vertices is not important. Path- a sequence of edges that starts at one vertex and ends at another. Circuit- a path that starts and stops at the same place. Connected graph- there is a path connecting every vertices. Bridge- one edge that if you removed said edge you get a disconnected graph. Euler path- a path that travels through every edge of a graph once and only once. Each edge must be traveled and no edge and be retraced.
