{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:46Z","timestamp":1760245066459},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":5798,"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":[[1997,9]]},"DOI":"10.1016\/s0012-365x(97)00313-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"3-17","source":"Crossref","is-referenced-by-count":4,"title":["Connectivity of large bipartite digraphs and graphs"],"prefix":"10.1016","volume":"174","author":[{"given":"M.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(97)00313-0_BIB1","series-title":"Colorations G\u00e9n\u00e9ralis\u00e9es Dans les Graphes","article-title":"R\u00e9seaux d'Interconnexion Bipartis","author":"A\u00efder","year":"1987"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB2","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(97)00313-0_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(97)00313-0_BIB4","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB5","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(97)00313-0_BIB6","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(97)00313-0_BIB7","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(97)00313-0_BIB8","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(97)00313-0_BIB9","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(97)00313-0_BIB10","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(97)00313-0_BIB11","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":"33","author":"Fiol","year":"1984","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB12","series-title":"Introduction \u00e0 la Th\u00e9orie des Graphes Orient\u00e9s","author":"Harary","year":"1968"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB13","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1109\/TC.1985.1676569","article-title":"Connectivity of regular directed graphs with small diameters","volume":"34","author":"Imase","year":"1985","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB14","first-page":"19","article-title":"On equality of edge-connectivity and minimum degree of a graph","volume":"25","author":"Plesnik","year":"1989","journal-title":"Arch. Math."},{"key":"10.1016\/S0012-365X(97)00313-0_BIB15","series-title":"Proc. 20th Ann. Allerton Conf","first-page":"1018","article-title":"On digraphs with minimum diameter and maximum connectivity","author":"Reddy","year":"1982"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB16","first-page":"811","article-title":"Sufficient conditions for dense graphs to be maximally connected","author":"Soneoka","year":"1985"},{"key":"10.1016\/S0012-365X(97)00313-0_BIB17","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:S0012365X97003130?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97003130?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:29:20Z","timestamp":1556130560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97003130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0012365X97003130"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00313-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}