Abstract
The distinguishing number (index) \(D(G)\) ( \(D^{\prime }(G) \)) of a graph \(G \) is the least integer \(d \) such that \(G \) has a vertex labeling (edge labeling) with \(d \) labels which is preserved only by a trivial automorphism. In this paper, we investigate the distinguishing numbers and the distinguishing indexes of Cayley graphs. In particular, we obtain an upper bound for the distinguishing numbers of Cayley graphs. Also, we present a family of the Cayley graphs, graphical regular representations of a group, for each of which the distinguishing number as well as the distinguishing index is \(2\).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
N. L. Biggs, Algebraic Graph Theory, 2nd Ed. (Cambridge University Press, Cambridge, 1993).
C. Godsil, “On the Full Automorphism Group of the Graph,” Combinatorica 1, 243–256 (1981).
M. Y. Xu, “Automorphism Groups and Isomorphisms of Cayley Digraphs,” Discrete Math. 182, 309–319 (1998).
M. O. Albertson and K. L. Collins, “Symmetry Breaking in Graphs,” Electron. J. Combin. 3, #R18 (1996).
K. L. Collins and A. N. Trenk, “The Distinguishing Chromatic Number,” Electron. J. Combin. 13, #R16 (2006).
S. Klavžar, T.-L. Wong, and X. Zhu, “Distinguishing Labelings of Group Action on Vector Spaces and Graphs,” J. Algebra 303, 626–641 (2006).
M. Pilśniak, “Improving Upper Bounds for the Distinguishing Index,” Ars Math. Contemp. 13, 259–274 (2017).
J. Tymoczko, “Distinguishing Number for Graphs and Groups,” Electron. J. Combin. 11, #R63 (2004).
M. Conder and T. Tucker, “Motion and Distinguishing Number Two,” Ars Math. Contemp. 4, 63–72 (2011).
Y-P. Deng and X-D. Zhang, “Automorphism Groups of the Pancake Graphs,” Inform. Process. Lett. 112 (7), 264–266 (2012).
A. Ganesan, “On the Automorphism Group of Cayley Graphs Generated by Transpositions,” Australas. J. Combin. 64 (3), 432–436 (2016).
A. V. Konygin, “On Primitive Permutation Groups with Nontrivial Global Stabilizers,” Proc. Steklov Inst. Math. 261 (1), 113–116 (2008).
L. Lovász, “Problem 11,” in Combinatorial Structures and Their Applications (Calgary, 1969) (Gordon and Breach, New York), pp. 243–246 (1970).
D. Witte and J. A. Gallian, “A Survey: Hamiltonian Cycles in Cayley Graphs,” Discrete Math. 51, 293–304 (1984).
S. Alikhani and S. Soltani, “The Distinguishing Number and the Distinguishing Index of Cayley Graphs,” Available at https://arxiv.org/abs/1704.04150.
F. Lehner, M. Pilsniak, and M. Stawiski, “A Bound for the Distinguishing Index of Regular Graphs,” European J. Combin. 89, 103145, 1-9 (2020).
ACKNOWLEDGMENTS
The authors would like to express their gratitude to the referee for her/his careful reading and helpful comments.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by The Authors
Rights and permissions
About this article
Cite this article
Alikhani, S., Soltani, S. The Distinguishing Numbers and the Distinguishing Indexes of Cayley Graphs. J. Appl. Ind. Math. 15, 1–6 (2021). https://doi.org/10.1134/S1990478921010014
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478921010014