{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:01:18Z","timestamp":1776441678872,"version":"3.51.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T00:00:00Z","timestamp":1731456000000},"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":["12061073"],"award-info":[{"award-number":["12061073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10878-024-01235-6","type":"journal-article","created":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T23:21:15Z","timestamp":1731540075000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An upper bound for neighbor-connectivity of graphs"],"prefix":"10.1007","volume":"48","author":[{"given":"Hongliang","family":"Ma","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7164-3116","authenticated-orcid":false,"given":"Baoyindureng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,13]]},"reference":[{"key":"1235_CR1","doi-asserted-by":"crossref","unstructured":"Akers SB, Krishnamurthy B (1989) IEEE Trans. Comput. 38:555\u2013566","DOI":"10.1109\/12.21148"},{"key":"1235_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty USR (2008) Graph Theory. Springer, Cham"},{"key":"1235_CR3","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1016\/j.disc.2005.09.018","volume":"306","author":"LL Doty","year":"2006","unstructured":"Doty LL (2006) A new bound for neighbor-connectivity of abelian Cayley graphs. Discrete Math. 306:1301\u20131316","journal-title":"Discrete Math."},{"issue":"3","key":"1235_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.7151\/dmgt.1559","volume":"31","author":"LL Doty","year":"2011","unstructured":"Doty LL (2011) Bounding neighbor-connectivity of abelian Cayley graphs. Discuss. Math. Graph Theory 31(3):475\u2013491","journal-title":"Discuss. Math. Graph Theory"},{"key":"1235_CR5","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/S0895480194265751","volume":"9","author":"LL Doty","year":"1996","unstructured":"Doty LL, Goldstone RJ, Suffel CL (1996) Cayley graphs with neighbor connectivity one. SIAM J. Discrete Math. 9:625\u2013642","journal-title":"SIAM J. Discrete Math."},{"issue":"125327","key":"1235_CR6","first-page":"9","volume":"379","author":"T Dvo\u0159\u00e1k","year":"2020","unstructured":"Dvo\u0159\u00e1k T, Gu M (2020) Neighbor connectivity of $$k$$-ary $$n$$-cubes. Appl. Math. Comput. 379(125327):9","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"1235_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates WH, Papadimitriou CH (1979) Bounds for sorting by prefix reversal. Discrete Math. 27(1):47\u201357","journal-title":"Discrete Math."},{"key":"1235_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.dam.2022.09.013","volume":"324","author":"MM Gu","year":"2023","unstructured":"Gu MM, Chang JM (2023) Neighbor connectivity of pancake graphs and burnt pancake graphs. Discrete Appl. Math. 324:46\u201357","journal-title":"Discrete Appl. Math."},{"key":"1235_CR9","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jpdc.2022.09.010","volume":"171","author":"MM Gu","year":"2023","unstructured":"Gu MM, Pai KJ, Chang JM (2023) Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. J. Parallel Distrib. Comput. 171:54\u201365","journal-title":"J. Parallel Distrib. Comput."},{"key":"1235_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(85)90075-7","volume":"11","author":"G Gunther","year":"1985","unstructured":"Gunther G (1985) Neighbour-connectivity in regular graphs. Discrete Appl. Math. 11:233\u2013243","journal-title":"Discrete Appl. Math."},{"key":"1235_CR11","unstructured":"Gunther G, Hartnell B (1978) On minimizing the effects of betrayals in a resistance movement, in: Proceedings of the Eighth Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, Manitoba, Canada, pp. 285-306"},{"key":"1235_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.3230170208","volume":"17","author":"G Gunther","year":"1987","unstructured":"Gunther G, Hartnell BL, Nowakowsk R (1987) Neighbor-connected graphs and projective planes. Networks 17:241\u2013247","journal-title":"Networks"},{"key":"1235_CR13","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/s10255-018-0739-9","volume":"34","author":"Y Shang","year":"2018","unstructured":"Shang Y, Hao R, Gu M (2018) Neighbor connectivity of two kinds of Cayley graphs. Acta Math. Appl. Sin. Engl. Ser. 34:386\u2013397","journal-title":"Acta Math. Appl. Sin. Engl. Ser."},{"key":"1235_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2022.03.002","volume":"916","author":"N Wang","year":"2022","unstructured":"Wang N, Meng JX, Tian YZ (2022) Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916:31\u201339","journal-title":"Theor. Comput. Sci."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01235-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01235-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01235-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T21:24:20Z","timestamp":1732051460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01235-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,13]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1235"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01235-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,13]]},"assertion":[{"value":"29 October 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2024","order":2,"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 that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"44"}}