{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T00:05:07Z","timestamp":1759104307154,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1811,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["MTM2005-08990-C02-02"],"award-info":[{"award-number":["MTM2005-08990-C02-02"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005992","name":"Ministry of Education and Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005992","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2008,8]]},"DOI":"10.1016\/j.dam.2007.11.015","type":"journal-article","created":{"date-parts":[[2008,1,7]],"date-time":"2008-01-07T07:17:33Z","timestamp":1199690253000},"page":"2827-2834","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Diameter-sufficient conditions for a graph to be super-restricted connected"],"prefix":"10.1016","volume":"156","author":[{"given":"Camino","family":"Balbuena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuqing","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2007.11.015_b1","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0012-365X(96)00314-7","article-title":"On the order and size of s-geodetic digraphs with given connectivity","volume":"174","author":"Balbuena","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b2","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/j.disc.2006.07.016","article-title":"On the restricted connectivity and superconnectivity in graphs with given girth","volume":"307","author":"Balbuena","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b3","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/j.ipl.2005.05.006","article-title":"Sufficient conditions for \u03bb\u2032-optimality of graphs with small conditional diameter","volume":"95","author":"Balbuena","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2007.11.015_b4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/jgt.20150","article-title":"Sufficient conditions for \u03bb\u2032-optimality in graphs with girth g","volume":"52","author":"Balbuena","year":"2006","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2007.11.015_b5","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1109\/TR.1986.4335424","article-title":"Synthesis of reliable networks-A survey","volume":"35","author":"Boesch","year":"1986","journal-title":"IEEE Trans. Reliab."},{"issue":"4","key":"10.1016\/j.dam.2007.11.015_b6","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"},{"year":"1996","series-title":"Graphs and Digraphs","author":"Chartrand","key":"10.1016\/j.dam.2007.11.015_b7"},{"key":"10.1016\/j.dam.2007.11.015_b8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","article-title":"On computing a conditional edge-connectivity of a graph","volume":"27","author":"Esfahanian","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/j.dam.2007.11.015_b9","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\/j.dam.2007.11.015_b10","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\/j.dam.2007.11.015_b11","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\/j.dam.2007.11.015_b12","first-page":"113","article-title":"Sufficient conditions for \u03bb\u2032-optimality in graphs of diameter 2","volume":"283","author":"Hellwig","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b13","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1002\/jgt.20053","article-title":"Sufficient conditions for graphs to be \u03bb\u2032-optimal, super-edge-connected, and maximally edge-connected","volume":"48","author":"Hellwig","year":"2005","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2007.11.015_b14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H","article-title":"Reliability analysis of circulant graphs","volume":"31","author":"Li","year":"1998","journal-title":"Networks"},{"key":"10.1016\/j.dam.2007.11.015_b15","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0166-218X(00)00337-1","article-title":"On a kind of restricted edge connectivity of graphs","volume":"117","author":"Meng","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2007.11.015_b16","first-page":"291","article-title":"3-restricted edge connectivity of vertex transitive graphs","volume":"74","author":"Ou","year":"2005","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2007.11.015_b17","first-page":"193","article-title":"Restricted edge-connectivity and minimum edge-degree","volume":"66","author":"Ueffing","year":"2003","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2007.11.015_b18","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0012-365X(02)00299-6","article-title":"Conditional edge-connectivity properties, reliability comparisons and transitivity of graphs","volume":"258","author":"Wang","year":"2002","journal-title":"Discrete Math."},{"issue":"6","key":"10.1016\/j.dam.2007.11.015_b19","first-page":"646","article-title":"Super-edge-connectivity properties of graphs with diameter 2","volume":"33","author":"Wang","year":"1999","journal-title":"J. Shanghai Jiaotong Univ. (Chin. Ed.)"},{"key":"10.1016\/j.dam.2007.11.015_b20","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.disc.2004.08.011","article-title":"Super restricted edge-connectivity of vertex transitive graphs","volume":"289","author":"Wang","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0012-365X(01)00232-1","article-title":"On restricted edge-connectivity of graphs","volume":"243","author":"Xu","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ipl.2005.02.001","article-title":"Super connectivity of line graphs","volume":"94","author":"Xu","year":"2005","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/j.dam.2007.11.015_b23","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.disc.2006.06.028","article-title":"On the Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal","volume":"307","author":"Zhang","year":"2007","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2007.11.015_b24","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1016\/j.dam.2005.09.015","article-title":"On optimally-\u03bb(3) transitive graphs","volume":"154","author":"Zhang","year":"2006","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X07005136?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X07005136?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:42Z","timestamp":1759060662000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X07005136"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":24,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["S0166218X07005136"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2007.11.015","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2008,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Diameter-sufficient conditions for a graph to be super-restricted connected","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2007.11.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2007 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}