DMU4D2A Graph Theory Vocabulary

Definition: There is a path going from any vertex to any other vertex

• Connected

• Adjacent

• Bridged

• Simple

Tags

CCSS.6.G.A.3

Definition: Sequence of edges each adjacent to the next with no edge included more than once and starting and ending at different vertices

• Path

• Circuit

• Loop

• Graph

Definition: An edge in a connected graph without which the graph would be disconnected

• Bridge

• Adjacent

• Simple

• Clique

Definition: Degree is an odd (even) number

• Odd

• Even

• Clique

• Loop

Tags

CCSS.1.MD.C.4

Definition: A set of completely interconnected vertices in the graph: every vertex is connected to every other vertex

• Clique

• Circuit

• Vertex set

• Connected

Definition: A circuit that covers all the edges of the graph

• Euler Circuit

• Euler Path

• Connected

• Clique

Definition: An edge that connects a vertex with itself

• Loop

• Odd

• Bridge

• Clique

Definition: Any two vertices connected by an edge

• Adjacent Vertices

• Vertex Set

• Euler Path

• Connected

Tags

CCSS.6.G.A.3

Definition: A graph with no loops or multiple edges

• Simple

• Odd

• Even

• Connected

Definition: Same as a path, but starting and ending on the same vertex

• Circuit

• Connected graph

• Simple graph

• Even graph