{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:53Z","timestamp":1759638413912},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0012-365x(99)90041-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"61-75","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Superconnectivity of bipartite digraphs and graphs"],"prefix":"10.1016","volume":"197-198","author":[{"given":"C.","family":"Balbuena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Carmona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"F\u00e0brega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.A.","family":"Fiol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(99)90041-9_BIB1","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF01110285","article-title":"On the linegraph of a directed graph","volume":"102","author":"Aigner","year":"1967","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0012-365X(97)00313-0","article-title":"Connectivity of large bipartite digraphs and graphs","volume":"174","author":"Balbuena","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB4","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","article-title":"Synthesis of reliable networks \u2014 a survey","volume":"35","author":"Boesch","year":"1986","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB5","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB6","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/jgt.3190090411","article-title":"Lower-bounds on the connectivities of a graph","volume":"9","author":"Esfahanian","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB7","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1002\/jgt.3190130603","article-title":"Maximally connected digraphs","volume":"13","author":"F\u00e0brega","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0166-218X(95)00097-B","article-title":"Bipartite graphs and digraphs with maximum connectivity","volume":"69","author":"F\u00e0brega","year":"1996","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB9","first-page":"5","article-title":"Connectivity and superconnectivity of large graphs and digraphs","volume":"29 B","author":"Fiol","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB10","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/jgt.3190160603","article-title":"On super-edge-connected digraphs and bipartite digraphs","volume":"16","author":"Fiol","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB11","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.3190170105","article-title":"The connectivity of large digraphs and graphs","volume":"17","author":"Fiol","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB12","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0012-365X(92)00051-R","article-title":"Superconnectivity of large graphs and digraphs","volume":"124","author":"Fiol","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0012-365X(94)90157-0","article-title":"On the distance connectivity of graphs and digraphs","volume":"125","author":"Fiol","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB14","first-page":"17","article-title":"Short paths and connectivity in graphs and digraphs","volume":"29 B","author":"Fiol","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB15","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1002\/jgt.3190140608","article-title":"Dense bipartite digraphs","volume":"14","author":"Fiol","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB16","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1109\/TC.1984.1676455","article-title":"Line digraph iterations and the (d,k) digraph problem","volume":"C-33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB17","series-title":"Introduction \u00e1 la Th\u00e9orie des Graphes Orient\u00e9s","author":"Harary","year":"1968"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameter","volume":"C-34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB19","series-title":"Proc. 20th Annual Allerton Conf.","first-page":"1018","article-title":"On digraphs with minimum diameter and maximum connectivity","author":"Reddy","year":"1982"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB20","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/0166-218X(92)90155-4","article-title":"Super edge-connectivity of dense digraphs and graphs","volume":"37\/38","author":"Soneoka","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(99)90041-9_BIB21","first-page":"811","article-title":"Sufficient conditions for dense graphs to be maximally connected","author":"Soneoka","year":"1985"},{"key":"10.1016\/S0012-365X(99)90041-9_BIB22","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0012-365X(87)90151-8","article-title":"Sufficient conditions for maximally connected dense graphs","volume":"63","author":"Soneoka","year":"1987","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900419?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X99900419?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:22:20Z","timestamp":1553214140000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X99900419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":22,"alternative-id":["S0012365X99900419"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(99)90041-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}