General Mathematics: Networks

Front

Vertex (Node)

Back

A point in a network where edges meet, representing objects or locations.

Front

Edge (Arc)

Back

A line connecting two vertices in a network, representing a relationship or path.

Front

Degree of a Vertex

Back

The number of edges connected to a vertex.

Front

Path

Back

A sequence of edges that connects a series of vertices without revisiting any vertex.

Front

Circuit (Cycle)

Back

A closed path that starts and ends at the same vertex, with no edge repeated.

Front

Connected Network

Back

A network where there is a path between any two vertices.

Front

Weighted Graph

Back

A graph where edges have values (weights), often representing costs, distances, or times.

Front

Directed Graph (Digraph)

Back

A graph where edges have a direction, indicated by arrows.

Front

Eulerian Path

Back

A path that travels along every edge of a network exactly once.

Front

Eulerian Circuit

Back

A circuit that travels along every edge of a network exactly once, starting and ending at the same vertex.