Graph labeling

In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to the edges or vertices, or both, of a graph.

Formally, given a graph G = (V, E), a vertex labeling is a function of V to a set of labels. A graph with such a function defined is called a vertex-labeled graph. Likewise, an edge labeling is a function of E to a set of labels. In this case, the graph is called an edge-labeled graph.

When the edge labels are members of an ordered set (e.g., the real numbers), it may be called a weighted graph.

When used without qualification, the term labeled graph generally refers to a vertex-labeled graph with all labels distinct. Such a graph may equivalently be labeled by the consecutive integers {1, …, | V  |}, where | V  | is the number of vertices in the graph. For many applications, the edges or vertices are given labels that are meaningful in the associated domain. For example, the edges may be assigned weights representing the "cost" of traversing between the incident vertices.

In the above definition a graph is understood to be a finite undirected simple graph. However, the notion of labeling may be applied to all extensions and generalizations of graphs. For example, in automata theory and formal language theory it is convenient to consider labeled multigraphs, i.e., a pair of vertices may be connected by several labeled edges.

Most graph labelings trace their origins to labelings presented by Alex Rosa in his 1967 paper. Rosa identified three types of labelings, which he called α-, β-, and ρ-labelings. β-labelings were later renamed graceful by S. W. Golomb and the name has been popular since.

A graph is known as graceful when its vertices are labeled from 0 to | E  |, the size of the graph, and this labeling induces an edge labeling from 1 to | E  |. For any edge e, the label of e is the positive difference between the two vertices incident with e. In other words, if e is incident with vertices labeled i and j, e will be labeled | i − j |. Thus, a graph G = (V, E) is graceful if and only if there exists an injection that induces a bijection from E to the positive integers up to | E  |.

...
Wikipedia