{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T23:16:07Z","timestamp":1654816567898},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T00:00:00Z","timestamp":1647216000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"national natural science foundation of china","doi-asserted-by":"publisher","award":["11301217, 61572010","11401510"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02468-0","type":"journal-article","created":{"date-parts":[[2022,3,14]],"date-time":"2022-03-14T16:05:32Z","timestamp":1647273932000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Extremal Sizes of Arc-Maximal (k,\u00a0l)-Digraphs"],"prefix":"10.1007","volume":"38","author":[{"given":"Liqiong","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-7698-2125","authenticated-orcid":false,"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[]},{"given":"Yingzhi","family":"Tian","sequence":"additional","affiliation":[]},{"given":"Murong","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,14]]},"reference":[{"key":"2468_CR1","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.: On $$k$$-maximal strength digraphs. J. Graph Theory 84, 17\u201325 (2017)","journal-title":"J. Graph Theory"},{"key":"2468_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Springer-Verlag, London (2009)","edition":"2"},{"key":"2468_CR3","doi-asserted-by":"crossref","unstructured":"Boesch, F.T., McHugh, J.A.M.: An edge extremal result for subcohesion. J. Combinatorial Theory Ser.B 38 (1985), 1-7","DOI":"10.1016\/0095-8956(85)90087-5"},{"key":"2468_CR4","unstructured":"Bollob\u00e1s, B.: Extremal Graph Theory. London Math. Soc. Monographs, Vol. 11, Academic Press, London, (1978)"},{"key":"2468_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New York (2008)"},{"key":"2468_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190140207","volume":"14","author":"H-J Lai","year":"1990","unstructured":"Lai, H.-J.: The size of strength-maximal graphs. J. Graph Theory 14, 187\u2013197 (1990)","journal-title":"J. Graph Theory"},{"key":"2468_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jgt.3190180303","volume":"18","author":"H-J Lai","year":"1994","unstructured":"Lai, H.-J., Zhang, C.: Edge-maximal $$(k, l)$$-graphs. J. Graph Theory 18, 227\u2013240 (1994)","journal-title":"J. Graph Theory"},{"key":"2468_CR8","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.: On the lower bound of $$k$$-maximal digraphs. Discrete Math. 339, 2500\u20132510 (2016)","journal-title":"Discrete Math."},{"key":"2468_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W Mader","year":"1971","unstructured":"Mader, W.: Minimale $$n$$-fach kantenzusammenhngende graphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"2468_CR10","doi-asserted-by":"crossref","unstructured":"Matula, D.W.: The cohesive strength of graphs, The Many Faces of Graph Theory, Lecture Notes in Mathematics, No. 110, G. Chartrand and S. F. Kapoor eds., Springer-Verlag, berlin, pp. 215-221 (1969)","DOI":"10.1007\/BFb0060120"},{"key":"2468_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/0122040","volume":"22","author":"D Matula","year":"1972","unstructured":"Matula, D.: $$K$$-components, clusters, and slicings in graphs. SIAM J. Appl. Math. 22, 459\u2013480 (1972)","journal-title":"SIAM J. Appl. Math."},{"key":"2468_CR12","unstructured":"Matula, D.W.: Subgraph connectivity number of a graph, Theorey and Applications of Graphs, Lecture Notes in Mathematics, No. 642, G. Chartrand and S. F. Kapoor eds., Springer-Verlag,"},{"key":"2468_CR13","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1007\/s00373-019-02052-z","volume":"35","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Lai, H.-J., Meng, J.: On the sizes of vertex-$$k$$-maximal $$r$$-uniform hypergraphs. Graphs Combin. 35, 1001\u20131010 (2019)","journal-title":"Graphs Combin."},{"key":"2468_CR14","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremal aufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02468-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02468-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:43:20Z","timestamp":1654814600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02468-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,14]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2468"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02468-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,14]]},"assertion":[{"value":"14 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"72"}}