Math 2.0

Combinatorics Definition

Graph

Definition

A graph, or simple graph, is a pair G=(V,E)G = (V, E) of a set VV and a set EE of 22-element subsets of VV. The elements of VV are the vertices of GG, and the elements of EE are its edges. Two vertices uu and vv are adjacent if {u,v}∈E\{u, v\} \in E. The notation for this edge is uvuv, and the notation for adjacency is u∼vu \sim v.

Equivalently, a graph is a set VV with a relation ∼\sim on VV that is symmetric and irreflexive. A graph is finite if VV is finite.

Remarks

In a simple graph, no edge joins a vertex to itself, and two vertices are joined by at most one edge. A multigraph drops the second condition, and some variants allow loops. In a directed graph the edges are ordered pairs. The set EE is the edge set of GG.

Where this leads

94 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Graph_(discrete_mathematics), Graph
About this page