Terminology (Leaving Cert Applied Maths): Flashcards

Vertices (nodes) and edges (arcs)

Number of edges meeting at that vertex

Numerical values assigned to edges

Edges without arrows; relationship goes both ways

Graph with edges having arrows showing direction

All vertices & edges must exist in original graph

No loops; at most one edge between any pair of vertices

Edge connecting a vertex to itself

Sequence of edges; can revisit same vertex

Walk where all vertices are different (no revisiting)

Closed path starting and ending at same vertex

Graph with a path between every pair of vertices

Connected graph with no cycles

Subgraph with all vertices forming a tree

$\sum_{v \in V} \deg(v) = 2|E|$ (sum of degrees = twice edges)