{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T21:22:34Z","timestamp":1773436954588,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1913-9","type":"journal-article","created":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T12:52:36Z","timestamp":1529412756000},"page":"777-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["The Connectivity of Token Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"J.","family":"Lea\u00f1os","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. L.","family":"Trujillo-Negrete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"11","key":"1913_CR1","doi-asserted-by":"publisher","first-page":"2026","DOI":"10.1016\/j.disc.2015.05.001","volume":"338","author":"SH Alavi","year":"2015","unstructured":"Alavi, S.H.: A generalisation of Johnson graphs with an application to triple factorisations. Discrete Math. 338(11), 2026\u20132036 (2015)","journal-title":"Discrete Math."},{"key":"1913_CR2","unstructured":"de Alba, H., Carballosa, W., Lea\u00f1os, J., Rivera, L.M.: Independence and matching numbers of some token graphs (2016). arXiv:1606.06370v2"},{"issue":"6","key":"1913_CR3","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. Comb. Theory Ser. B 100(6), 671\u2013682 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"1913_CR4","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(1), 74\u201390 (2007)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"1913_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/PL00009259","volume":"23","author":"V Auletta","year":"1999","unstructured":"Auletta, V., Monti, A., Parente, M., Persiano, P.: A linear-time algorithm for the feasibility of pebble motion on trees. Algorithmica 23(3), 223\u2013245 (1999)","journal-title":"Algorithmica"},{"issue":"1","key":"1913_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1137\/060652063","volume":"22","author":"G C\u0103linescu","year":"2008","unstructured":"C\u0103linescu, G., Dumitrescu, A., Pach, J.: Reconfigurations in graphs and grids. SIAM J. Discrete Math. 22(1), 124\u2013138 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1913_CR7","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., Lea\u00f1os, J., Rivera, L.M.: Regularity and planarity of token graphs. Discuss. Math. Graph Theory 37, 573\u2013586 (2017). (to appear)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"1913_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(96)00104-7","volume":"70","author":"T Etzion","year":"1996","unstructured":"Etzion, T., Bitan, S.: On the chromatic number, colorings, and codes of the Johnson graph. Discrete Appl. Math. 70(2), 163\u2013175 (1996)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"1913_CR9","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-Pe\u00f1aloza, D., Huemer, C., Hurtado, F., Urrutia, J., Wood, D.R.: Token graphs. Gr. Combin. 28(3), 365\u2013380 (2012)","journal-title":"Gr. Combin."},{"issue":"12\u201314","key":"1913_CR10","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.tcs.2010.12.005","volume":"412","author":"T Ito","year":"2011","unstructured":"Ito, T., Demaine, E.D., Harvey, N.J.A., Papadimitriou, C.H., Sideri, M., Uehara, R., Uno, Y.: On the complexity of reconfiguration problems. Theor. Comput. Sci. 412(12\u201314), 1054\u20131065 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"1913_CR11","doi-asserted-by":"crossref","unstructured":"Kornhauser, D., Miller, G., Spirakis, P.: Coordinating pebble motion on graphs, the diameter of permutations groups, and applications, vol 1. Proc. 25th IEEE symposium on foundations of computer science, pp 241\u2013250. Singer Island, FL (1984)","DOI":"10.1109\/SFCS.1984.715921"},{"key":"1913_CR12","first-page":"132","volume":"2","author":"KG Mirajkar","year":"2016","unstructured":"Mirajkar, K.G., Priyanka, Y.B.: Traversability and covering invariants of token graphs. Math. Combin. 2, 132\u2013138 (2016)","journal-title":"Math. Combin."},{"issue":"1","key":"1913_CR13","doi-asserted-by":"crossref","first-page":"120","DOI":"10.37236\/209","volume":"16","author":"A Rahnamai Barghi","year":"2009","unstructured":"Rahnamai Barghi, A., Ponomarenko, I.: Non-isomorphic graphs with cospectral symmetric powers. Electron. J. Combin. 16(1), 120 (2009). (Research paper)","journal-title":"Electron. J. Combin."},{"issue":"2","key":"1913_CR14","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0747-7171(08)80001-6","volume":"10","author":"D Ratner","year":"1990","unstructured":"Ratner, D., Warmuth, M.: The $$(n^2-1)$$ ( n 2 - 1 ) -puzzle and related relocation problems. J. Symb. Comput. 10(2), 111\u2013137 (1990)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1913_CR15","first-page":"41","volume":"3","author":"H Riyono","year":"2007","unstructured":"Riyono, H.: Hamiltonicity of the graph $$G(n, k)$$ G ( n , k ) of the Johnson scheme. J. Inform. 3(1), 41\u201347 (2007)","journal-title":"J. Inform."},{"key":"1913_CR16","unstructured":"Rudolph, T.: Constructing physically intuitive graph invariants (2002) arXiv:quant-ph\/0206068"},{"issue":"2","key":"1913_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0012-365X(86)90160-3","volume":"58","author":"P Terwilliger","year":"1986","unstructured":"Terwilliger, P.: The Johnson graph $$J(d, r)$$ J ( d , r ) is unique if $$(d, r)\\ne (2,8)$$ ( d , r ) \u2260 ( 2 , 8 ) . Discrete Math. 58(2), 175\u2013189 (1986)","journal-title":"Discrete Math."},{"key":"1913_CR18","doi-asserted-by":"crossref","unstructured":"van den Heuvel, J.: The complexity of change. Surveys in combinatorics 2013. Lond. Math. Soc. Lecture Note Ser., vol. 409. Cambridge University Press, Cambridge, pp. 127\u2013160 (2013)","DOI":"10.1017\/CBO9781139506748.005"},{"key":"1913_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2015.01.052","volume":"586","author":"K Yamanaka","year":"2015","unstructured":"Yamanaka, K., Demaine, E.D., Ito, T., Kawahara, J., Kiyomi, M., Okamoto, Y., Saitoh, T., Suzuki, A., Uchizawa, K., Uno, T.: Swapping labeled tokens on graphs. Theor. Comput. Sci. 586, 81\u201394 (2015)","journal-title":"Theor. Comput. Sci."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1913-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1913-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1913-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,3]],"date-time":"2020-11-03T23:07:44Z","timestamp":1604444864000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1913-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,19]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1913"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1913-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,19]]},"assertion":[{"value":"11 December 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}