Overview (Leaving Cert Applied Maths): Flashcards

Points in a graph connected by edges

Lines connecting nodes/vertices

Number of edges meeting at that node

Graph where edges have numerical values (weights) representing distances, costs, etc.

Graph with edges showing direction of travel (arrows)

Moving along $n$ edges, can revisit nodes

Walk where all nodes visited are different

Path that starts and ends at same vertex

$\sum \text{degrees} = 2 \times \text{number of edges}$

Which nodes are directly connected (using 0s and 1s)

Number of walks of length $n$ between nodes

Connected graph with no cycles

Exactly one path connects any two nodes

Subgraph with all vertices from $P$ forming a tree

Spanning tree with smallest possible total weight