{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T14:05:14Z","timestamp":1769004314158,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,8]],"date-time":"2011-03-08T00:00:00Z","timestamp":1299542400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00373-011-1035-0","type":"journal-article","created":{"date-parts":[[2011,3,6]],"date-time":"2011-03-06T19:46:22Z","timestamp":1299440782000},"page":"287-296","source":"Crossref","is-referenced-by-count":2,"title":["On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs"],"prefix":"10.1007","volume":"28","author":[{"given":"Yingzhi","family":"Tian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jixiang","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaodong","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,8]]},"reference":[{"key":"1035_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/net.3230100206","volume":"10","author":"M.O. Ball","year":"1980","unstructured":"Ball M.O.: Complexity of network reliability computation. Networks 10, 153\u2013165 (1980)","journal-title":"Networks"},{"key":"1035_CR2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1002\/net.3230150210","volume":"15","author":"D. Bauer","year":"1985","unstructured":"Bauer D., Boesch F., Suffel C., Tindell R.: Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15, 257\u2013271 (1985)","journal-title":"Networks"},{"key":"1035_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. Macmillan, London (1976)"},{"key":"1035_CR4","volume-title":"The Combinatorics of Network Reliability","author":"C.J. Colbourn","year":"1987","unstructured":"Colbourn C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)"},{"issue":"11","key":"1035_CR5","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1109\/12.42131","volume":"38","author":"A.H. Esfahanian","year":"1989","unstructured":"Esfahanian A.H.: Generalized measures of fault tolerance with application to n-cube Networks. IEEE Trans. Comput. 38(11), 1586\u20131591 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"1035_CR6","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"A.H. Esfahanian","year":"1988","unstructured":"Esfahanian A.H., Hakimi S.L.: On computing a conditional edge-connectivity of a graph. Inf. Process. Lett. 27, 195\u2013199 (1988)","journal-title":"Inf. Process. Lett."},{"key":"1035_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1002\/net.3230130303","volume":"13","author":"F. Harary","year":"1983","unstructured":"Harary F.: Conditional connectivity. Networks 13, 347\u2013357 (1983)","journal-title":"Networks"},{"key":"1035_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H","volume":"31","author":"Q.L. Li","year":"1998","unstructured":"Li Q.L., Li Q.: Reliability analysis of circulants. Networks 31, 61\u201365 (1998)","journal-title":"Networks"},{"key":"1035_CR9","doi-asserted-by":"crossref","unstructured":"Liang, X.D., Meng, J.X.: Connectivity of Connected Bipartite Graphs with Two Orbits, Lecture notes in computer science, vol. 4489, pp. 334\u2013337. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-72588-6_55"},{"key":"1035_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01433466","volume":"191","author":"W. Mader","year":"1971","unstructured":"Mader W.: Minimale n-fach kantenzusammenh\u00e4ngenden Graphen. Math. Ann. 191, 21\u201328 (1971)","journal-title":"Math. Ann."},{"key":"1035_CR11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0012-365X(02)00675-1","volume":"260","author":"J.X. Meng","year":"2003","unstructured":"Meng J.X.: Optimally super-edge-connected transitive graphs. Discret. Math. 260, 239\u2013248 (2003)","journal-title":"Discret. Math."},{"key":"1035_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0166-218X(00)00337-1","volume":"117","author":"J.X. Meng","year":"2002","unstructured":"Meng J.X., Ji Y.H.: On a kind of restricted edge connectivity of graphs. Discret. Appl. Math. 117, 183\u2013193 (2002)","journal-title":"Discret. Appl. Math."},{"key":"1035_CR13","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J.S. Provan","year":"1983","unstructured":"Provan J.S., Ball M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12, 777\u2013788 (1983)","journal-title":"SIAM J. Comput."},{"key":"1035_CR14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4757-2491-2_2","volume-title":"Combinatorial Network Theory","author":"R. Tindell","year":"1996","unstructured":"Tindell R.: Connectivity of Cayley digraphs. In: Du, D.Z., Hsu, D.F. (eds) Combinatorial Network Theory, pp. 41\u201346. Klumer, Dordrecht (1996)"},{"key":"1035_CR15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.disc.2004.08.011","volume":"289","author":"Y.Q. Wang","year":"2004","unstructured":"Wang Y.Q.: Super restricted edge-connectivity of vertex-transitive graphs. Discret. Math. 289, 199\u2013205 (2004)","journal-title":"Discret. Math."},{"key":"1035_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0012-365X(02)00299-6","volume":"258","author":"M. Wang","year":"2002","unstructured":"Wang M., Li Q.: Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discret. Math. 258, 205\u2013214 (2002)","journal-title":"Discret. Math."},{"key":"1035_CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0012-365X(01)00232-1","volume":"243","author":"J.M. Xu","year":"2002","unstructured":"Xu J.M., Xu K.L.: On restricted edge connectivity of graphs. Discret. Math. 243, 291\u2013298 (2002)","journal-title":"Discret. Math."},{"key":"1035_CR18","first-page":"379","volume-title":"Introduction to Group Theory (in Chinese)","author":"M.Y. Xu","year":"1999","unstructured":"Xu M.Y., Huang J.H., Li H.L., Li S.R.: Introduction to Group Theory (in Chinese), pp. 379\u2013386. Academic Publishes, New York (1999)"},{"key":"1035_CR19","first-page":"297","volume":"LXXVIII","author":"Z. Zhang","year":"2006","unstructured":"Zhang Z., Meng J.X.: Restricted edge connectivity of edge transitive graphs. Ars Combin. LXXVIII, 297\u2013308 (2006)","journal-title":"Ars Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1035-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1035-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1035-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T23:21:43Z","timestamp":1560036103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1035-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,8]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["1035"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1035-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,8]]}}}