A bound for the distinguishing index of regular graphs

Symmetry Breaking in Graphs

Michael O. Albertson, Karen L. Collins · The Electronic Journal of Combinatorics · 1996 · 271 citations · Full text

Geometric Graph Theory, Graph Theory, Vertex Labels +8

Continuous increasing functions of finite and transfinite ordinals

Oswald Veblen · Transactions of the American Mathematical Society · 1908 · 99 citations

Order Theory, Set-theoretic Topology, Transfinite Ordinals +2

Distinguishing graphs by edge-colourings

Rafał Kalinowski, Monika Pilśniak · European Journal of Combinatorics · 2014 · 61 citations

Network Science, Graph Theory, Data Science +10

The distinguishing number of Cartesian products of complete graphs

Wilfried Imrich, Janja Jerebic, Sandi Klavžar · European Journal of Combinatorics · 2008 · 57 citations

Cartesian Products, Geometric Graph Theory, Engineering +8

Asymmetric trees with two prescribed degrees

László Babai · Acta Mathematica Academiae Scientiarum Hungaricae · 1977 · 57 citations

Tree Language, Graph Theory, Asymmetric Trees +3