{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:41:50Z","timestamp":1769845310696,"version":"3.49.0"},"reference-count":30,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T00:00:00Z","timestamp":1511222400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/about_us\/legal\/notices"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772010"],"award-info":[{"award-number":["61772010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1093\/comjnl\/bxx109","type":"journal-article","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T08:08:39Z","timestamp":1509523719000},"page":"761-772","source":"Crossref","is-referenced-by-count":7,"title":["Edge Fault Tolerance of Cartesian Product Graphs on Super Restricted Edge Connectivity"],"prefix":"10.1093","volume":"61","author":[{"given":"Shiying","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guozhen","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Feng","sequence":"additional","affiliation":[{"name":"School of Computer and Information Technology, Shanxi University, Taiyuan, Shanxi 030006, PR China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,11,21]]},"reference":[{"key":"key\n\t\t\t\t20180425035434_bxx109C1","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/j.dam.2011.10.033","article-title":"Edge fault tolerance of graphs with respect to super edge connectivity","volume":"160","author":"Hong","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.ins.2011.11.006","article-title":"Edge fault tolerance of super edge connectivity for three families of interconnection networks","volume":"188","author":"Wang","year":"2012","journal-title":"Inf. Sci."},{"key":"key\n\t\t\t\t20180425035434_bxx109C3","doi-asserted-by":"crossref","first-page":"2152","DOI":"10.1080\/00207160.2014.883069","article-title":"Arc fault tolerance of cartesian product digraphs on hyper arc connectivity","volume":"91","author":"Zhang","year":"2014","journal-title":"Int. J. Comput. Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0012-365X(92)00475-7","article-title":"Extraconnectivity of graphs with large girth","volume":"127","author":"F\u00e0brega","year":"1994","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C5","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":"key\n\t\t\t\t20180425035434_bxx109C6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/S0012-365X(02)00385-0","article-title":"Edge-cuts leaving components of order at least three","volume":"256","author":"Bonsma","year":"2002","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C7","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":"Inf. Process. Lett."},{"key":"key\n\t\t\t\t20180425035434_bxx109C8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.disc.2004.11.004","article-title":"Cuts leaving components of given minimal order","volume":"292","author":"Hellwig","year":"2005","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C9","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.disc.2005.10.012","article-title":"Edge cuts leaving components of order at least m","volume":"305","author":"Ou","year":"2005","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C10","doi-asserted-by":"crossref","first-page":"5562","DOI":"10.1016\/j.disc.2007.10.008","article-title":"Some remarks on \u03bbp,q-connectedness","volume":"308","author":"Rautenbach","year":"2008","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C11","first-page":"297","article-title":"Restricted edge connectivity of edge transitive graphs","volume":"78","author":"Zhang","year":"2006","journal-title":"Ars Combin."},{"key":"key\n\t\t\t\t20180425035434_bxx109C12","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.disc.2005.04.020","article-title":"A proof of an inequality concerning k-restricted edge connectivity","volume":"304","author":"Zhang","year":"2005","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C13","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":"key\n\t\t\t\t20180425035434_bxx109C14","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."},{"key":"key\n\t\t\t\t20180425035434_bxx109C15","doi-asserted-by":"crossref","first-page":"2886","DOI":"10.1016\/j.disc.2008.07.022","article-title":"Sufficient conditions for bipartite graphs to be super-k-restricted edge connected","volume":"309","author":"Yuan","year":"2009","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C16","author":"Cheng","year":"2015"},{"key":"key\n\t\t\t\t20180425035434_bxx109C17","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1016\/j.dam.2012.01.022","article-title":"k-restricted edge-connectivity in triangle-free graphs","volume":"160","author":"Holtkamp","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C18","doi-asserted-by":"crossref","first-page":"3122","DOI":"10.1016\/j.ins.2009.05.005","article-title":"Super p-restricted edge connectivity of line graphs","volume":"179","author":"Lin","year":"2009","journal-title":"Inf. Sci."},{"key":"key\n\t\t\t\t20180425035434_bxx109C19","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.tcs.2013.10.021","article-title":"Vulnerability of super edge-connected networks","volume":"520","author":"Hong","year":"2014","journal-title":"Theor. Comput. Sci."},{"key":"key\n\t\t\t\t20180425035434_bxx109C20","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":"key\n\t\t\t\t20180425035434_bxx109C21","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 Theor."},{"key":"key\n\t\t\t\t20180425035434_bxx109C22","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":"key\n\t\t\t\t20180425035434_bxx109C23","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":"key\n\t\t\t\t20180425035434_bxx109C24","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1002\/net.20217","article-title":"Sufficient conditions for a graph to be super restricted edge-connected","volume":"51","author":"Wang","year":"2008","journal-title":"Networks"},{"key":"key\n\t\t\t\t20180425035434_bxx109C25","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":"key\n\t\t\t\t20180425035434_bxx109C26","doi-asserted-by":"crossref","first-page":"2683","DOI":"10.1016\/j.disc.2011.08.021","article-title":"On super 2-restricted and 3-restricted edge-connected vertex transitive graphs","volume":"311","author":"Yang","year":"2011","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3387-7","volume-title":"Topological Structure and Analysis of Interconnection Networks","author":"Xu","year":"2001"},{"key":"key\n\t\t\t\t20180425035434_bxx109C28","volume-title":"Graph Theory","author":"Bondy","year":"2007"},{"key":"key\n\t\t\t\t20180425035434_bxx109C29","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.disc.2005.11.010","article-title":"Connectivity of cartesian product graphs","volume":"306","author":"Xu","year":"2006","journal-title":"Discrete Math."},{"key":"key\n\t\t\t\t20180425035434_bxx109C30","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.disc.2010.12.012","article-title":"On optimizing edge connectivity of product graphs","volume":"311","author":"Ou","year":"2011","journal-title":"Discrete Math."}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/comjnl\/article-pdf\/61\/5\/761\/24724642\/bxx109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T08:37:04Z","timestamp":1570264624000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/61\/5\/761\/4643583"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,21]]},"references-count":30,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2017,11,21]]},"published-print":{"date-parts":[[2018,5,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxx109","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,5]]},"published":{"date-parts":[[2017,11,21]]}}}