{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T01:07:51Z","timestamp":1773018471722,"version":"3.50.1"},"reference-count":17,"publisher":"Oxford University Press (OUP)","license":[{"start":{"date-parts":[[2018,10,20]],"date-time":"2018-10-20T00:00:00Z","timestamp":1539993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11731002"],"award-info":[{"award-number":["11731002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"crossref","award":["2016JBZ012"],"award-info":[{"award-number":["2016JBZ012"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"crossref"}]},{"name":"111 Project of China","award":["B16002"],"award-info":[{"award-number":["B16002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1093\/comjnl\/bxy106","type":"journal-article","created":{"date-parts":[[2018,10,10]],"date-time":"2018-10-10T21:02:33Z","timestamp":1539205353000},"source":"Crossref","is-referenced-by-count":3,"title":["The Generalized Connectivity of (n,k)-Bubble-Sort Graphs"],"prefix":"10.1093","author":[{"given":"Shu-Li","family":"Zhao","sequence":"first","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8714-8750","authenticated-orcid":false,"given":"Rong-Xia","family":"Hao","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Beijing Jiaotong University, Beijing, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lidong","family":"Wu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Texas at Tyler, Tyler, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"key":"key\n\t\t\t\t20181020024304596_bxy106C1","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","article-title":"Congruent graphs and the connectivity of graphs","volume":"54","author":"Whitney","year":"1932","journal-title":"Am. J. Math."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C2","first-page":"1","article-title":"Generalized connectivity in graphs","volume":"2","author":"Chartrand","year":"1984","journal-title":"Bull. Bombay Math. Colloq."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10878-011-9399-x","article-title":"Note on the hardness of generalized connectivity","volume":"24","author":"Li","year":"2012","journal-title":"J. Comb. Optim."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C4","first-page":"193","article-title":"Note on the generalized connectivity","volume":"114","author":"Li","year":"2014","journal-title":"Ars Comb."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C5","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1016\/j.disc.2010.04.011","article-title":"Sharp bounds for the generalized connectivity \u03ba3(G)","volume":"310","author":"Li","year":"2010","journal-title":"Discret. Math."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C6","first-page":"360","article-title":"Rainbow trees in graphs and generalized connectivity","volume":"55","author":"Chartrand","year":"2010","journal-title":"Networks"},{"key":"key\n\t\t\t\t20181020024304596_bxy106C7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10878-016-0075-z","article-title":"On the minimally 2-connected graphs with generalized connectivity \u03ba3 = 2","volume":"34","author":"Li","year":"2017","journal-title":"J. Comb. Optim."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.commatsci.2011.09.003","article-title":"The generalized 3-connectivity of Cartesian product graphs","volume":"14","author":"Li","year":"2012","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C9","first-page":"77","article-title":"The generalized 3-connectivity of graph products","volume":"295","author":"Li","year":"2017","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C10","first-page":"65","article-title":"The generalized connectivity of complete bipartite graphs","volume":"104","author":"Li","year":"2012","journal-title":"Ars Comb."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C11","first-page":"41","article-title":"The generalized 3-connectivity of star graphs and bubble-sort graphs","volume":"274","author":"Li","year":"2016","journal-title":"Appl. Math. Comput."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C12","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1007\/s00373-017-1837-9","article-title":"The generalized 3-connectivity of Cayley graphs on Symmetric Groups generated by trees and cycles","volume":"33","author":"Li","year":"2017","journal-title":"Graph. Combinator."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C13","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2016.12.003","article-title":"The generalized 4-connectivity of hypercubes","volume":"220","author":"Lin","year":"2017","journal-title":"Discret. Appl. Math."},{"key":"key\n\t\t\t\t20181020024304596_bxy106C14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"key\n\t\t\t\t20181020024304596_bxy106C15","first-page":"199","article-title":"On conjectures of interconnection networks","volume":"44","author":"Shi","year":"2008","journal-title":"Comput. Eng. Appl"},{"key":"key\n\t\t\t\t20181020024304596_bxy106C16","author":"Shavash","year":"2008"},{"key":"key\n\t\t\t\t20181020024304596_bxy106C17","doi-asserted-by":"crossref","first-page":"2408","DOI":"10.1080\/00207160902883514","article-title":"Matching preclusion for the (n, k)-bubble-sort graphs","volume":"87","author":"Cheng","year":"2010","journal-title":"Int. J. Comput. Math."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/advance-article-pdf\/doi\/10.1093\/comjnl\/bxy106\/26119999\/bxy106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T06:43:22Z","timestamp":1589957002000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/advance-article\/doi\/10.1093\/comjnl\/bxy106\/5139680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,20]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxy106","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,20]]}}}