Handbook of combinatorics

A graph G consists of a nonempty set V(G) of elements, called vertices or nodes, and a set E(G) of elements called edges, together with a relation of incidence that associates with each edge two vertices, called its ends...