{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T14:17:34Z","timestamp":1768745854652,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T00:00:00Z","timestamp":1579132800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T00:00:00Z","timestamp":1579132800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301217"],"award-info":[{"award-number":["11301217"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11401510"],"award-info":[{"award-number":["11401510"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771093"],"award-info":[{"award-number":["11771093"]}],"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":[[2020,4]]},"DOI":"10.1007\/s10878-020-00522-2","type":"journal-article","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T15:02:37Z","timestamp":1579186957000},"page":"859-873","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the sizes of bi-k-maximal graphs"],"prefix":"10.1007","volume":"39","author":[{"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7698-2125","authenticated-orcid":false,"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,16]]},"reference":[{"key":"522_CR1","unstructured":"Anderson J (2017) A study of arc strong connectivity of digraphs, PhD Dissertation, West Virginia University"},{"key":"522_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1002\/jgt.22008","volume":"84","author":"J Anderson","year":"2017","unstructured":"Anderson J, Lai H-J, Lin X, Xu M (2017) On $$k$$-maximal strength digraphs. J Graph Theory 84:17\u201325","journal-title":"J Graph Theory"},{"issue":"1","key":"522_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/23799927.2017.1410498","volume":"3","author":"J Anderson","year":"2018","unstructured":"Anderson J, Lai H-J, Li X, Lin X, Xu M (2018) Minimax properties of some density measures in graphs and digraphs. Int J Comput Math Comput Syst Theor 3(1):1\u201312","journal-title":"Int J Comput Math Comput Syst Theor"},{"key":"522_CR4","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, New York"},{"key":"522_CR5","first-page":"245","volume":"140","author":"Y-C Chen","year":"2003","unstructured":"Chen Y-C, Tan JJM, Hsu L-H, Kao S-S (2003) Super-connectivity and super-edge-connectivity for some internation networks. Appl Math Comput 140:245\u2013254","journal-title":"Appl Math Comput"},{"key":"522_CR6","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"AH Esfahanian","year":"1988","unstructured":"Esfahanian AH, Hakimi SL (1988) On computing a conditional edgeconnectivity of a graph. Inf Process Lett 27:195\u2013199","journal-title":"Inf Process Lett"},{"key":"522_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190140207","volume":"14","author":"H-J Lai","year":"1990","unstructured":"Lai H-J (1990) The size of strength-maximal graphs. J Graph Theory 14:187\u2013197","journal-title":"J Graph Theory"},{"key":"522_CR8","first-page":"147","volume":"143","author":"P Li","year":"2019","unstructured":"Li P, Lai H-J, Xu M (2019) Disjoint spanning arborescences in $$k$$-arc-strong digraphs. ARS Comb 143:147\u2013163","journal-title":"ARS Comb"},{"key":"522_CR9","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.1016\/j.disc.2016.04.007","volume":"339","author":"X Lin","year":"2016","unstructured":"Lin X, Fan S, Lai H-J, Xu M (2016) On the lower bound of $$k$$-maximal digraphs. Discrete Math 339:2500\u20132510","journal-title":"Discrete Math"},{"key":"522_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W Mader","year":"1971","unstructured":"Mader W (1971) Minimale $$n$$-fach kantenzusammenhngende graphen. Math Ann 191:21\u201328","journal-title":"Math Ann"},{"key":"522_CR11","first-page":"481","volume":"10","author":"DW Matula","year":"1968","unstructured":"Matula DW (1968) A min\u2013max theorem for graphs with application to graph coloring. SIAM Rev 10:481\u2013482","journal-title":"SIAM Rev"},{"key":"522_CR12","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BFb0060120","volume-title":"The many facets of graph theory. Lecture notes in mathematics","author":"DW Matula","year":"1969","unstructured":"Matula DW (1969) The cohesive strength of graphs. In: Chartrand G, Kapoor SF (eds) The many facets of graph theory. Lecture notes in mathematics, vol 110. Springer, Berlin, pp 215\u2013221"},{"key":"522_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D Matula","year":"1972","unstructured":"Matula D (1972) $$K$$-components, clusters, and slicings in graphs. SIAM J Appl Math 22:459\u2013480","journal-title":"SIAM J Appl Math"},{"key":"522_CR14","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BFb0070394","volume-title":"Theory and applications of graphs. Lecture notes in mathematics","author":"DW Matula","year":"1976","unstructured":"Matula DW (1976) Subgraph connectivity number of a graph. In: Alavi Y, Ricks DR (eds) Theory and applications of graphs. Lecture notes in mathematics, vol 642. Springer, Berlin, pp 371\u2013393"},{"key":"522_CR15","unstructured":"Xu JM. Super or restricted connectivity of graphs, a survey (to appear)"},{"key":"522_CR16","unstructured":"Xu M (2018) A study on graph coloring and digraph connectivity, PhD Dissertation, West Virginia University"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00522-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00522-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00522-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T00:48:18Z","timestamp":1610671698000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00522-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,16]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["522"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00522-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,16]]},"assertion":[{"value":"16 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}