{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:26Z","timestamp":1761611066988},"reference-count":16,"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(96)00314-7","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"19-27","source":"Crossref","is-referenced-by-count":22,"title":["On the order and size of s-geodetic digraphs with given connectivity"],"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(96)00314-7_BIB1","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1109\/TCT.1970.1083102","article-title":"On the smallest-branch cuts in directed graphs","volume":"CT-17","author":"Ayoub","year":"1970","journal-title":"IEEE Trans. Circuit Theory"},{"key":"10.1016\/S0012-365X(96)00314-7_BIB2","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(96)00314-7_BIB3","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0114065","article-title":"A graph-theoretic approach to a communications problem","volume":"14","author":"Chartrand","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB4","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(96)00314-7_BIB5","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(96)00314-7_BIB6","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(96)00314-7_BIB7","first-page":"17","article-title":"Short paths and connectivity in graphs and digraphs","volume":"29B","author":"Fiol","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB8","first-page":"105","article-title":"Connectivity in digraphs","volume":"vol. 186","author":"Geller","year":"1970"},{"key":"10.1016\/S0012-365X(96)00314-7_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(80)90180-6","article-title":"A property of \u03b1-fragments of a digraph","volume":"31","author":"Hamidoune","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0012-365X(85)80010-8","article-title":"Sur les atomes d'un graphe orient\u00e9, ab\u00e9liens","volume":"55","author":"Hamidoune","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF01788139","article-title":"Vosperian and superconnected abelian Cayley digraphs","volume":"7","author":"Hamidoune","year":"1991","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB12","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0012-365X(74)90154-X","article-title":"Results on the edge-connectivity of graphs","volume":"8","author":"Lesniak","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00314-7_BIB13","first-page":"29","article-title":"Strongly geodetic directed graphs","volume":"29","author":"Plesnik","year":"1974","journal-title":"Acta Fac. Rerum Natur. Univ. Comenian, Math. Publ."},{"key":"10.1016\/S0012-365X(96)00314-7_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. (Brno)"},{"key":"10.1016\/S0012-365X(96)00314-7_BIB15","first-page":"811","article-title":"Sufficient conditions for dense graphs to be maximally connected","author":"Soneoka","year":"1985"},{"key":"10.1016\/S0012-365X(96)00314-7_BIB16","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:S0012365X96003147?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96003147?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:29:20Z","timestamp":1556116160000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96003147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0012365X96003147"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00314-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}