Lukas' Notes

Definition

Graph

A graph is a pair , where is a set of vertices and is a set of edges connecting vertices in .

Directedness

Undirected

Definition

Undirected Graph

A graph is called undirected if every edge is an unordered pair over the vertices, i.e.,

Link to original

Directed

Definition

Directed Graph

A graph is called directed if every edge is an ordered pair of vertices, i.e.,

Link to original