{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T09:19:51Z","timestamp":1782897591724,"version":"3.54.5"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0166-218x(00)00337-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T03:52:51Z","timestamp":1027569171000},"page":"183-193","source":"Crossref","is-referenced-by-count":78,"title":["On a kind of restricted edge connectivity of graphs"],"prefix":"10.1016","volume":"117","author":[{"given":"Jixiang","family":"Meng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Youhu","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00337-1_BIB1","unstructured":"S.B. Akers, D. Horel, B. Krishanamurthy, The star graph: an attractive alternative to the n-cube, Proceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400."},{"key":"10.1016\/S0166-218X(00)00337-1_BIB2","unstructured":"D. Bauer, F. Boesch, C. Suffel, R. Tindell, Connectivity extremal problems and the design of reliable probabilistic networks, The Theory and Application of Graphs, Wiley, New York, 1981, pp. 89\u201398."},{"key":"10.1016\/S0166-218X(00)00337-1_BIB3","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\/S0166-218X(00)00337-1_BIB4","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0607011","article-title":"Super line connectivity properties of circulant graphs","volume":"1","author":"Boesch","year":"1986","journal-title":"SIAM J. Algebra Discrete Math."},{"key":"10.1016\/S0166-218X(00)00337-1_BIB5","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."},{"key":"10.1016\/S0166-218X(00)00337-1_BIB6","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1002\/net.3230130303","article-title":"Conditional connectivity","volume":"13","author":"Harary","year":"1983","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00337-1_BIB7","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\/S0166-218X(00)00337-1_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<157::AID-NET6>3.0.CO;2-D","article-title":"Super edge connectivity of connected edge symmetric graphs","volume":"33","author":"Li","year":"1999","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(00)00337-1_BIB9","series-title":"Combinatorial Network Theory","first-page":"41","article-title":"Connectivity of Cayley graphs","author":"Tindell","year":"1996"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T19:50:57Z","timestamp":1557085857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0166218X00003371"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00337-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}