Graphs key words

A set of nodes together with a set of edges.

Has a node at each end.

Edge with the same node at each end.

Number of edges incident (attached) to it.

Graoh with no loops, no more than one edge connecting any pair of nodes.

Sequence of edges where the end of one edge is the beginning of the next.

Walk in which no edge is repeated.

Trail in which no node is repeated.

Closed path (end of last edge is start of first edge).

Cycle which visits every node.

Paths exist between every pair of nodes (each node has a degree of at least one).

Simple connected graph with no cycles.

Graph where at least one edge has a direction to it.

Simple graph, every pair of nodes is connected by an edge.

Matrix that represents a graph.

Two graphs that can be distorted into each other (have the same connections).

Graph where no edges cross.

Graph with two sets of nodes, each node connected to another node in the opposite set