Graph - A figure containing 1 or more vertices and 1 or more edges, Loop - An edge that connects a vertex to itself, Multiple Edges - 2 or more edges that connect the same vertices, Adjacent Vertices - Vertices that have at least 1 edge joining them, Adjacent Edges - 2 or more edges which share at least 1 common vertex, Degree of a Vertex - The number of edges at a vertex, Degree of a graph - The sum of all the vertex degrees, Route - A sequence of adjacent vertices, Circuit - A route that begins and ends at the same vertex, Path - A route that begins and ends at different vertices, Connected Graph - A graph in which at least 1 route is possible from any vertex to any other vertex, Disconnected Graph - A graph which is not connected, Equivalent - Having a one-to-one correspondence between edges and vertices, Bridge - An edge which, if and when taken away, would turn a graph into a disconnected graph,

Math 45 Chapter 5 Terminology

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?