乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:00Z","timestamp":1740107100838,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T00:00:00Z","timestamp":1616630400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T00:00:00Z","timestamp":1616630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00373-021-02301-0","type":"journal-article","created":{"date-parts":[[2021,3,25]],"date-time":"2021-03-25T22:57:59Z","timestamp":1616713079000},"page":"1013-1023","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Edge-Connectivity of Token Graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"J.","family":"Lea\u00f1os","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2702-9981","authenticated-orcid":false,"given":"Christophe","family":"Ndjatchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,25]]},"reference":[{"issue":"1","key":"2301_CR1","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. Combin. Inform. System Sci. 16(1), 37\u201350 (1991)","journal-title":"J. Combin. Inform. System Sci."},{"issue":"11","key":"2301_CR2","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."},{"issue":"6","key":"2301_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-Lehman refinements. J. Combin. Theory Ser. B 100(6), 671\u2013682 (2010)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"2301_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":"2301_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"},{"key":"2301_CR6","doi-asserted-by":"publisher","unstructured":"Brouwer, A.E., Etzion, T.: Some new distance-4 constant weight codes, Adv. Math. Commun., 5, 2011, 3, 417\u2013424, 1930-5346, MR2831612, https:\/\/doi.org\/10.3934\/amc.2011.5.417","DOI":"10.3934\/amc.2011.5.417"},{"issue":"1","key":"2301_CR7","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":"2301_CR8","doi-asserted-by":"publisher","unstructured":"Carballosa, W, Fabila-Monroy, R., Lea\u00f1os, J., Rivera, L. M.: Regularity and planarity of token graphs. Discuss. Math. Graph Theory, 37, 2017, 3, 573\u2013586, 1234-3099, MR3666665, https:\/\/doi.org\/10.7151\/dmgt.1959","DOI":"10.7151\/dmgt.1959"},{"key":"2301_CR9","unstructured":"de Alba, H., Carballosa, W., Duarte, D., Rivera, L.M.: Cohen-Macaulayness of triangular graphs. Bull. Math. Soc. Sci. Math. Roumanie (N.S.), 60(108), 2017, 2, 103\u2013112, 1220-3874, MR3676580"},{"issue":"2","key":"2301_CR10","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":"2301_CR11","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. Graphs Combin. 28(3), 365\u2013380 (2012)","journal-title":"Graphs Combin."},{"key":"2301_CR12","doi-asserted-by":"publisher","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, 2018, 327\u2013340, 0166-218X, MR3843346, https:\/\/doi.org\/10.1016\/j.dam.2018.03.085","DOI":"10.1016\/j.dam.2018.03.085"},{"issue":"12\u201314","key":"2301_CR13","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":"2301_CR14","unstructured":"Kornhauser, D., Miller, G., Spirakis, P.: Coordinating pebble motion on graphs, the diameter of permutations groups, and applications. In: Proc. 25th IEEE Symposium on Foundations of Computer Science, (1984), 1, 241\u2013250"},{"key":"2301_CR15","doi-asserted-by":"publisher","first-page":"132","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 Combinat. 34, 132\u2013138 (2018)","journal-title":"Graphs Combinat."},{"key":"2301_CR16","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. Combinat. 2, 132\u2013138 (2016)","journal-title":"Math. Combinat."},{"key":"2301_CR17","doi-asserted-by":"crossref","unstructured":"Ouyang, Y.: Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations, J. Math. Phys. 60, (2019), 7, 071901, 18","DOI":"10.1063\/1.5084136"},{"key":"2301_CR18","doi-asserted-by":"crossref","unstructured":"Rahnamai Barghi, A., Ponomarenko, I.: Non-isomorphic graphs with cospectral symmetric powers. Electron. J. Combin. 16 (2009), 1, Research Paper 120, 14","DOI":"10.37236\/209"},{"issue":"2","key":"2301_CR19","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)$$-puzzle and related relocation problems. J Symb Comput 10(2), 111\u2013137 (1990)","journal-title":"J Symb Comput"},{"issue":"1","key":"2301_CR20","first-page":"41","volume":"3","author":"H Riyono","year":"2007","unstructured":"Riyono, H.: Hamiltonicity of the graph $$G(n, k)$$ of the Johnson scheme. J. Inform. 3(1), 41\u201347 (2007)","journal-title":"J. Inform."},{"key":"2301_CR21","unstructured":"T. Rudolph: Constructing physically intuitive graph invariants. arXiv:quant-ph\/0206068 (2002)"},{"issue":"2","key":"2301_CR22","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)$$ is unique if $$(d, r)\\ne (2,8)$$. Discrete Math. 58(2), 175\u2013189 (1986)","journal-title":"Discrete Math."},{"key":"2301_CR23","unstructured":"van den Heuvel, J.: The complexity of change, Surveys in combinatorics: London Math. Soc. Lecture Note Ser., 409, Cambridge Univ. Press, Cambridge 2013, 127\u2013160 (2013)"},{"key":"2301_CR24","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":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02301-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02301-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02301-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T14:49:00Z","timestamp":1619448540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02301-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,25]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2301"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02301-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,3,25]]},"assertion":[{"value":"19 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}