Acknowledgement
The authors would like to express their gratitude to the referees for their careful reading and helpful comments.
References
- M.O. Albertson and K.L. Collins, Symmetry breaking in graphs, Electron. J. Combin. 3 (1996), #R18. https://doi.org/10.37236/1242
- S. Alikhani and S. Soltani, The chromatic distinguishing index of certain graphs, AKCE Int. J. Graphs Combin. 17(1) (2020), 131--138. https://doi.org/10.1016/j.akcej.2019.03.008
- K. L. Collins and A. N. Trenk, The distinguishing chromatic number, Electron. J. Combin. 13 (2006), #R16. https://doi.org/10.37236/1042
- A. Gorzkowska, R. Kalinowski, and M. Pilsniak, The distinguishing index of the Cartesian product of finite graphs, Ars Math. Contem. 12 (2017), 77-87. https://doi.org/10.26493/1855-3974.909.0e1
- R. Hammack, W. Imrich and S. Klavzar, Handbook of product graphs (second edition), Taylor & Francis group 2011.
- W. Imrich, Automorphismen und das kartesische Produkt von Graphen, Osterreich. Akad.Wiss. Math.-Natur. Kl. S.-B. II 177 (1969), 203-214.
- W. Imrich, J. Jerebic and S. Klavzar, The distinguishing number of Cartesian products of complete graphs, European J. Combin. 29 (4) (2008), 922-929. https://doi.org/10.1016/j.ejc.2007.11.018
- W. Imrich and S. Klavzar, Distinguishing Cartesian powers of graphs, J. Graph Theory, 53.3 (2006), 250-260. https://doi.org/10.1002/jgt.20190
- R. Kalinowski and M. Pilsniak, Distinguishing graphs by edge colourings, European J. Combin. 45 (2015), 124-131. https://doi.org/10.1016/j.ejc.2014.11.003
- D. Kral, J. Maxova, R. Samal, and P. Podbrdsky, Hamilton cycles in strong products of graphs, J. Graph Theory, 48 (4) (2005), 299-321. https://doi.org/10.1002/jgt.20058
- D. J. Miller, The automorphism group of a product of graphs, Proc. Amer. Math. Soc. 25 (1970), 24-28. https://doi.org/10.1090/S0002-9939-1970-0262116-3
- M. Pilsniak, Improving upper bounds for the distinguishing index, Ars Math. Contemp. 13 (2017), 259--274. https://doi.org/10.26493/1855-3974.981.ff0