Graph labeling 📖 Wikipedia

In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph.^[1]

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.^[1] 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.^[2]

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.^[3]

Most graph labelings trace their origins to labelings presented by Alexander Rosa in his 1967 paper.^[4] Rosa identified three types of labelings, which he called α-, β-, and ρ-labelings.^[5] β-labelings were later renamed as "graceful" by Solomon Golomb, and the name has been popular since.

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

In his original paper, Rosa proved that all Eulerian graphs with size equivalent to 1 or 2 (mod 4) are not graceful. Whether or not certain families of graphs are graceful is an area of graph theory under extensive study. Arguably, the largest unproven conjecture in graph labeling is the Ringel–Kotzig conjecture, which hypothesizes that all trees are graceful. This has been proven for all paths, caterpillars, and many other infinite families of trees. Anton Kotzig himself has called the effort to prove the conjecture a "disease".^[6]

An edge-graceful labeling on a simple graph without loops or multiple edges on p vertices and q edges is a labeling of the edges by distinct integers in {1, …, q} such that the labeling on the vertices induced by labeling a vertex with the sum of the incident edges taken modulo p assigns all values from 0 to p − 1 to the vertices. A graph G is said to be "edge-graceful" if it admits an edge-graceful labeling.

Edge-graceful labelings were first introduced by Sheng-Ping Lo in 1985.^[7]

A necessary condition for a graph to be edge-graceful is "Lo's condition":

${\displaystyle q(q+1)={\frac {p(p-1)}{2}}\mod p.}$

A "harmonious labeling" on a graph G is an injection from the vertices of G to the group of integers modulo k, where k is the number of edges of G, that induces a bijection between the edges of G and the numbers modulo k by taking the edge label for an edge (x, y) to be the sum of the labels of the two vertices x, y (mod k). A "harmonious graph" is one that has a harmonious labeling. Odd cycles are harmonious, as are Petersen graphs. It is conjectured that trees are all harmonious if one vertex label is allowed to be reused.^[8] The seven-page book graph K_1,7 × K₂ provides an example of a graph that is not harmonious.^[9]

A graph coloring is a subclass of graph labelings. Vertex colorings assign different labels to adjacent vertices, while edge colorings assign different labels to adjacent edges.^[10]

A lucky labeling of a graph G is an assignment of positive integers to the vertices of G such that if S(v) denotes the sum of the labels on the neighbors of v, then S is a vertex coloring of G. The "lucky number" of G is the least k such that G has a lucky labeling with the integers {1, …, k}.^[11]

An antimagic labeling of a graph G is a one-to-one assignment of the positive integers {1,..., |E|} to the edges of G such that all induced vertex weights are distinct, where the weight of a vertex is the sum of the labels on all edges incident to it.^[12]

A (distance) magic labeling of a graph G is a one-to-one assignment of the positive integers {1,..., |V|} to the vertices of G such that all vertex weights are equal to some positive integer k. The weight of a vertex is the sum of the labels of all vertices adjacent to it. Such a constant k, if it exists, is called magic constant of a graph.