Distinguishing Properties in Graph Theory

Distinguishing properties in graph theory encompass a suite of concepts and invariants designed to quantify and break symmetries in graphs by means of labellings or colourings. At the heart of this field lies the distinguishing number, which measures the minimum count of vertex colours required so that only the trivial automorphism preserves the colouring. Variants include the distinguishing index for edge labellings, the distinguishing chromatic number where the colouring must also be proper, and the distinguishing threshold, defined as the least integer for which every labelling of that size is distinguishing. These notions draw on group‐theoretic insights into the automorphism group of a graph and intersect with classical structural graph theory, combinatorial design and network analysis. Research has established exact values and bounds for families such as paths, cycles, trees and Cartesian products, and has extended to infinite graphs and endomorphism‐based generalisations. Applications span network symmetry breaking for unique identification of nodes, chemical graph isomer enumeration, robust network labelling for communication protocols and algorithmic considerations in symmetry detection. Advances in this area continue to reveal deep links between graph products, automorphism decompositions and extremal symmetry conditions.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Distinguishing Properties in Graph Theory publication trend

The graph below shows the total number of articles in distinguishing properties in graph theory across all publications each year (not limited to Nature Index journals).

Technical terms

Graph automorphism: A bijective mapping of a graph’s vertices that preserves adjacency relationships.

Distinguishing number (D(G)): The minimum number of vertex colours needed so that only the identity automorphism fixes every colour class setwise.

Distinguishing threshold (θ(G)): The smallest integer k such that every vertex colouring with k colours is distinguishing.

Distinguishing chromatic number (χD(G)): The least number of colours in a proper vertex colouring that is preserved only by the trivial automorphism.

Kronecker product: A graph formed by taking ordered pairs of vertices from two factor graphs, with adjacency determined by simultaneous adjacency in each factor.

Graphoidal cover: A collection of paths in a graph such that every edge lies in exactly one path and every vertex is an internal vertex of at most one path.

Graphoidal graph: The intersection graph whose vertices represent the paths of a graphoidal cover and whose edges indicate non‐empty vertex intersection of those paths.

References

1. On the distinguishing chromatic number of the Kronecker products of graphs. AKCE International Journal of Graphs and Combinatorics (2023).
2. Distinguishing threshold of graphs. Journal of Graph Theory (2022).
3. The distinguishing number and the distinguishing index of line and graphoidal graph(s). AKCE International Journal of Graphs and Combinatorics (2020).
4. Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups. The Electronic Journal of Combinatorics (2014).
5. Endomorphism Breaking in Graphs. The Electronic Journal of Combinatorics (2014).