{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:17:40Z","timestamp":1757618260420,"version":"3.44.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T00:00:00Z","timestamp":1749859200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T00:00:00Z","timestamp":1749859200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331013","12161141005"],"award-info":[{"award-number":["12331013","12161141005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"111 Project of China","award":["B16002"],"award-info":[{"award-number":["B16002"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2018R1D1A1B05048450","2021K2A9A2A11101586"],"award-info":[{"award-number":["2018R1D1A1B05048450","2021K2A9A2A11101586"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2024JBZX002","12425111"],"award-info":[{"award-number":["2024JBZX002","12425111"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s00373-025-02940-7","type":"journal-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T22:19:39Z","timestamp":1749853179000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automorphism Groups of 2-Token Graph of Cartesian Product of Two Cycles"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-4875-8840","authenticated-orcid":false,"given":"Ju","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Young Soo","family":"Kwon","sequence":"additional","affiliation":[]},{"given":"Jin-Xin","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,14]]},"reference":[{"key":"2940_CR1","doi-asserted-by":"publisher","first-page":"767","DOI":"10.7151\/dmgt.2400","volume":"43","author":"FM Abdelmalek","year":"2023","unstructured":"Abdelmalek, F.M., Meulen, E.V., Meulen, K.N.V., Tuyl, A.V.: Well-covered token graphs. Discuss. Math. Graph. Theory 43, 767\u2013792 (2023). https:\/\/doi.org\/10.7151\/dmgt.2400","journal-title":"Discuss. Math. Graph. Theory"},{"key":"2940_CR2","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.3390\/sym13061076","volume":"13","author":"LE Adame","year":"2021","unstructured":"Adame, L.E., Rivera, L.M., Trujillo-Negrete, A.L.: Hamiltonicity of token graphs of some join graphs. Symmetry 13, 1076 (2021). https:\/\/doi.org\/10.3390\/sym13061076","journal-title":"Symmetry"},{"key":"2940_CR3","first-page":"37","volume":"16","author":"Y Alavi","year":"1991","unstructured":"Alavi, Y., Behzad, M., Erd\u0151s, P., Lick, D.R.: Double vertex graphs. J. Comb. Inf. Syst. Sci. 16, 37\u201350 (1991)","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"2940_CR4","unstructured":"Alavi, Y., Behzad, M., Simpson, J.E.: Planarity of double vertex graphs, graph theory. In: Combinatorics, Algorithms, and Applications, (San Francisco, CA, 1989), pp. 472\u2013485. SIAM, Philadelphia (1991)"},{"key":"2940_CR5","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s003730200055","volume":"18","author":"Y Alavi","year":"2002","unstructured":"Alavi, Y., Lick, D.R., Liu, J.: Survey of double vertex graphs. Graphs Combin. 18, 709\u2013715 (2002). https:\/\/doi.org\/10.1007\/s003730200055","journal-title":"Graphs Combin."},{"key":"2940_CR6","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.jctb.2010.07.001","volume":"100","author":"A Alzaga","year":"2010","unstructured":"Alzaga, A., Iglesias, R., Pignol, R.: Spectra of symmetric powers of graphs and the Weisfeiler\u2013Lehman refinements. J. Combin. Theory Ser. B 100, 671\u2013682 (2010). https:\/\/doi.org\/10.1016\/j.jctb.2010.07.001","journal-title":"J. Combin. Theory Ser. B"},{"key":"2940_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.jctb.2006.04.002","volume":"97","author":"K Audenaert","year":"2007","unstructured":"Audenaert, K., Godsil, C., Royle, G., Rudolph, T.: Symmetric squares of graphs. J. Combin. Theory Ser. B 97, 74\u201390 (2007). https:\/\/doi.org\/10.1016\/j.jctb.2006.04.002","journal-title":"J. Combin. Theory Ser. B"},{"key":"2940_CR8","volume-title":"Graph Theory, Graduate Texts in Mathematics Series","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics Series. Springer, Berlin (2008)"},{"key":"2940_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbol. Comput. 24, 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125","journal-title":"J. Symbol. Comput."},{"key":"2940_CR10","doi-asserted-by":"publisher","first-page":"573","DOI":"10.7151\/dmgt.1959","volume":"37","author":"W Carballosa","year":"2017","unstructured":"Carballosa, W., Fabila-Monroy, R., Leanos, J., Rivera, L.M.: Regularity and planarity of token graphs. Discuss. Math. Graph Theory 37, 573\u2013586 (2017). https:\/\/doi.org\/10.7151\/dmgt.1959","journal-title":"Discuss. Math. Graph Theory"},{"key":"2940_CR11","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1016\/j.laa.2021.05.005","volume":"625","author":"C Dalf\u00f3","year":"2021","unstructured":"Dalf\u00f3, C., Duque, F., Fabila-Monroy, R., Fiol, M.A., Huemer, C., Trujillo-Negrete, A.L., Zaragoza Mart\u00ednez, F.J.: On the Laplacian spectra of token graphs. Linear Algebra Appl. 625, 322\u2013348 (2021). https:\/\/doi.org\/10.1016\/j.laa.2021.05.005","journal-title":"Linear Algebra Appl."},{"key":"2940_CR12","volume-title":"Permutation Groups, Graduate Texts in Mathematics Series","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups, Graduate Texts in Mathematics Series. Springer, Berlin (1996)"},{"key":"2940_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00373-011-1055-9","volume":"28","author":"R Fabila-Monroy","year":"2012","unstructured":"Fabila-Monroy, R., Flores-Penaloza, D., Huemer, C., Hurtado, F., Urrutia, J., Wood, D.R.: Token graphs. Graphs Combin. 28, 365\u2013380 (2012). https:\/\/doi.org\/10.1007\/s00373-011-1055-9","journal-title":"Graphs Combin."},{"key":"2940_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.46298\/dmtcs.7538","volume":"24","author":"R Fabila-Monroy","year":"2022","unstructured":"Fabila-Monroy, R., Lea\u00f1os, J., Trujillo-Negrete, A.L.: On the connectivity of token Graphs of trees. Discrete Math. Theor. Comput. Sci. 24, 23 (2022). https:\/\/doi.org\/10.46298\/dmtcs.7538","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2940_CR15","unstructured":"Fabila-Monroy, R., Trujillo-Negrete, A.L.: Connected ($$C_4$$, Diamond)-Free Graphs are Uniquely Reconstructible from Their Token Graphs. arXiv: 2207.12336"},{"key":"2940_CR16","first-page":"391","volume":"136","author":"A Ganesan","year":"2018","unstructured":"Ganesan, A.: On the automorphism group of a Johnson graph. ARS Combin. 136, 391\u2013396 (2018)","journal-title":"ARS Combin."},{"key":"2940_CR17","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1016\/j.disc.2008.05.054","volume":"309","author":"Y Gao","year":"2009","unstructured":"Gao, Y., Shao, Y.: Double vertex digraphs of digraphs. Discrete Math. 309, 2432\u20132444 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.05.054","journal-title":"Discrete Math."},{"key":"2940_CR18","volume-title":"Algebraic Graph Theory, Graduate Texts in Mathematics Series","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory, Graduate Texts in Mathematics Series. Springer, Berlin (2001)"},{"key":"2940_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/j.dam.2018.03.085","volume":"247","author":"JM G\u00f3mez Soto","year":"2018","unstructured":"G\u00f3mez Soto, J.M., Lea\u00f1os, J., R\u00edos-Castro, L.M., Rivera, L.M.: The packing number of the double vertex graph of the path graph. Discrete Appl. Math. 247, 327\u2013340 (2018). https:\/\/doi.org\/10.1016\/j.dam.2018.03.085","journal-title":"Discrete Appl. Math."},{"key":"2940_CR20","doi-asserted-by":"publisher","DOI":"10.1201\/b10959","volume-title":"Handbook of Product Graphs","author":"R Hammack","year":"2011","unstructured":"Hammack, R., Imrich, W., Klav\u017ear, S.: Handbook of Product Graphs, 2nd edn. CRC Press, Taylor & Francis Group, Boca Raton (2011)","edition":"2"},{"key":"2940_CR21","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.22199\/issn.0717-6279-5954","volume":"42","author":"S Ibarra","year":"2023","unstructured":"Ibarra, S., Rivera, L.M.: The automorphism groups of some token graphs. Proyecciones 42, 1627\u20131651 (2023). https:\/\/doi.org\/10.22199\/issn.0717-6279-5954","journal-title":"Proyecciones"},{"key":"2940_CR22","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.ejc.2004.01.012","volume":"26","author":"G Jones","year":"2005","unstructured":"Jones, G.: Automorphisms and regular embeddings of Johnson graphs. Eur. J. Combin. 26, 417\u2013435 (2005). https:\/\/doi.org\/10.1016\/j.ejc.2004.01.012","journal-title":"Eur. J. Combin."},{"key":"2940_CR23","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/s00373-021-02301-0","volume":"37","author":"J Lea\u00f1os","year":"2021","unstructured":"Lea\u00f1os, J., Ndjatchi, C.: The edge-connectivity of token graphs. Graphs Combin. 37, 1013\u20131023 (2021). https:\/\/doi.org\/10.1007\/s00373-021-02301-0","journal-title":"Graphs Combin."},{"key":"2940_CR24","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s00373-018-1913-9","volume":"34","author":"J Lea\u00f1os","year":"2018","unstructured":"Lea\u00f1os, J., Trujillo-Negrete, A.L.: The connectivity of token graphs. Graphs Combin. 34, 777\u2013790 (2018). https:\/\/doi.org\/10.1007\/s00373-018-1913-9","journal-title":"Graphs Combin."},{"key":"2940_CR25","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1137\/090765596","volume":"25","author":"M Ramras","year":"2011","unstructured":"Ramras, M., Donovan, E.: The automorphism group of a Johnson graph. SIAM J. Discrete Math. 25, 267\u2013270 (2011). https:\/\/doi.org\/10.1137\/090765596","journal-title":"SIAM J. Discrete Math."},{"key":"2940_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.laa.2023.09.004","volume":"679","author":"MA Reyes","year":"2023","unstructured":"Reyes, M.A., Dalf\u00f3, C., Fiol, M.A., Messegu\u00e9, A.: On the spectra of token graphs of cycles and other graphs. Linear Algebra Appl. 679, 38\u201366 (2023). https:\/\/doi.org\/10.1016\/j.laa.2023.09.004","journal-title":"Linear Algebra Appl."},{"key":"2940_CR27","doi-asserted-by":"publisher","first-page":"113043","DOI":"10.1016\/j.disc.2022.113043","volume":"345","author":"J Zhang","year":"2022","unstructured":"Zhang, J., Zhou, J.-X.: Edge-transitive token graphs. Discrete Math. 345, 113043 (2022). https:\/\/doi.org\/10.1016\/j.disc.2022.113043","journal-title":"Discrete Math."},{"key":"2940_CR28","doi-asserted-by":"publisher","first-page":"113689","DOI":"10.1016\/j.disc.2023.113689","volume":"347","author":"J Zhang","year":"2024","unstructured":"Zhang, J., Zhou, J.-X., Lee, J., Li, Y.-T., Xie, J.-H.: Automorphism group of 2-token graph of the Hamming graph. Discrete Math. 347, 113689 (2024). https:\/\/doi.org\/10.1016\/j.disc.2023.113689","journal-title":"Discrete Math."},{"key":"2940_CR29","doi-asserted-by":"publisher","first-page":"127872","DOI":"10.1016\/j.amc.2023.127872","volume":"446","author":"J Zhang","year":"2023","unstructured":"Zhang, J., Zhou, J.-X., Li, Y.-T., Kwon, Y.S.: The automorphisms of 2-token graphs. Appl. Math. Comput. 446, 127872 (2023). https:\/\/doi.org\/10.1016\/j.amc.2023.127872","journal-title":"Appl. Math. Comput."},{"key":"2940_CR30","first-page":"97","volume":"89","author":"B Zhu","year":"1992","unstructured":"Zhu, B., Liu, J., Lick, D.R., Alavi, Y.: $$n$$-tuple vertex graphs. Congr. Numer. 89, 97\u2013106 (1992)","journal-title":"Congr. Numer."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02940-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02940-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02940-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T19:27:48Z","timestamp":1757186868000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02940-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,14]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2940"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02940-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,6,14]]},"assertion":[{"value":"27 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"77"}}