Graph Theory/Nodes & edges
From Wikibooks, open books for an open world
This page may need to be [edit] Basic Definitions
A graph is an ordered pair G = (V,E) where:
- V is the vertex set" whose elements are the vertices, or nodes of the graph. This set is often denoted V(G) or just V.
- E is the edge set" whose elements are the edges, or connections between vertices, of the graph. This set is often denoted E(G) or just E. Individual edges are ordered pairs (u,v) where u and v are vertices in V.
Two graphs G and H are considered equal when V(G) = V(H) and E(G) = E(H).
The order of a graph the number of vertices in it, usually denoted | V | or sometimes n. The size of a graph is the number of edges in it, denoted | E | , or sometimes m. If n = 0 or m = 0, the graph is called empty or null. If n = 1 the graph is considered trivial.
