{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:29Z","timestamp":1759638569870},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"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,4]]},"DOI":"10.1016\/s0012-365x(96)00218-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:36:38Z","timestamp":1027604198000},"page":"85-100","source":"Crossref","is-referenced-by-count":20,"special_numbering":"C","title":["Extraconnectivity of graphs with large minimum degree and girth"],"prefix":"10.1016","volume":"167-168","author":[{"given":"C.","family":"Balbuena","sequence":"first","affiliation":[]},{"given":"A.","family":"Carmona","sequence":"additional","affiliation":[]},{"given":"J.","family":"F\u00e0brega","sequence":"additional","affiliation":[]},{"given":"M.A.","family":"Fiol","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00218-X_BIB1","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)00218-X_BIB2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(96)00218-X_BIB3","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0021-9800(68)80052-3","article-title":"Strongly geodetic graphs","volume":"5","author":"Bos\u00e1k","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0012-365X(96)00218-X_BIB4","series-title":"Graphs and Digraphs","author":"Chartrand","year":"1986"},{"key":"10.1016\/S0012-365X(96)00218-X_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(96)00218-X_BIB6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0012-365X(94)00369-T","article-title":"On the extraconnectivity of graphs","volume":"155","author":"F\u00e0brega","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00218-X_BIB7","first-page":"17","article-title":"Short paths and connectivity in graphs and digraphs","volume":"29","author":"Fiol","year":"1990","journal-title":"Ars Combin. B"},{"key":"10.1016\/S0012-365X(96)00218-X_BIB8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(96)00218-X_BIB9","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)00218-X_BIB10","series-title":"Proc. ISCA85","first-page":"811","article-title":"Sufficient conditions for dense graphs to be maximally connected","author":"Soneoka","year":"1985"},{"key":"10.1016\/S0012-365X(96)00218-X_BIB11","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:S0012365X9600218X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600218X?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:27:50Z","timestamp":1556116070000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600218X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":11,"alternative-id":["S0012365X9600218X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00218-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}