{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,17]],"date-time":"2024-08-17T05:12:39Z","timestamp":1723871559409},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1016\/j.jpdc.2022.09.010","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T15:59:21Z","timestamp":1663343961000},"page":"54-65","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Subversion analyses of hierarchical networks based on (edge) neighbor connectivity"],"prefix":"10.1016","volume":"171","author":[{"given":"Mei-Mei","family":"Gu","sequence":"first","affiliation":[]},{"given":"Kung-Jui","family":"Pai","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9542-7968","authenticated-orcid":false,"given":"Jou-Ming","family":"Chang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jpdc.2022.09.010_br0010","series-title":"Proc. Int'l Conf. Parallel Processing","first-page":"393","article-title":"The star graph: an attractive alternative to the n-cube","author":"Akers","year":"1987"},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0020","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/j.jpdc.2022.09.010_br0030","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1093\/comjnl\/bxr137","article-title":"Node-to-set disjoint-path routing in hierarchical cubic networks","volume":"55","author":"Bossard","year":"2012","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0040","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1093\/comjnl\/bxs171","article-title":"Set-to-set disjoint-path routing in hierarchical cubic networks","volume":"57","author":"Bossard","year":"2014","journal-title":"Comput. J."},{"key":"10.1016\/j.jpdc.2022.09.010_br0050","first-page":"107","article-title":"Super-connectivity of star graphs, alternating graphs and split stars","volume":"59","author":"Cheng","year":"2001","journal-title":"Ars Comb."},{"issue":"1\u20132","key":"10.1016\/j.jpdc.2022.09.010_br0060","article-title":"Connectivity results of complete cubic networks as associated with linearly many faults","volume":"15","author":"Cheng","year":"2015","journal-title":"J. Interconnect. Netw."},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0070","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/1383-7621(96)00019-7","article-title":"Topological properties of hierarchical cubic networks","volume":"42","author":"Chiang","year":"1996","journal-title":"J. Syst. Archit."},{"key":"10.1016\/j.jpdc.2022.09.010_br0080","first-page":"199","article-title":"Extreme values of the edge-neighbor-connectivity","volume":"39","author":"Cozzens","year":"1995","journal-title":"Ars Comb."},{"issue":"13","key":"10.1016\/j.jpdc.2022.09.010_br0090","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1016\/j.disc.2005.09.018","article-title":"A new bound for neighbor-connectivity of abelian Cayley graphs","volume":"306","author":"Doty","year":"2006","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0100","doi-asserted-by":"crossref","first-page":"475","DOI":"10.7151\/dmgt.1559","article-title":"Bounding neighbor-connectivity of abelian Cayley graphs","volume":"31","author":"Doty","year":"2011","journal-title":"Discuss. Math., Graph Theory"},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0110","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1137\/S0895480194265751","article-title":"Cayley graphs with neighbor connectivity one","volume":"9","author":"Doty","year":"1996","journal-title":"SIAM J. Discrete Math."},{"issue":"7","key":"10.1016\/j.jpdc.2022.09.010_br0120","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1109\/71.395400","article-title":"Algorithms and properties of a new two-level network with folded hypercubes as basic modules","volume":"6","author":"Duh","year":"1995","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2022.09.010_br0130","doi-asserted-by":"crossref","DOI":"10.1016\/j.amc.2020.125237","article-title":"Neighbor connectivity of k-ary n-cubes","volume":"379","author":"Dvo\u0159\u00e1k","year":"2020","journal-title":"Appl. Math. Comput."},{"issue":"11","key":"10.1016\/j.jpdc.2022.09.010_br0140","doi-asserted-by":"crossref","first-page":"1586","DOI":"10.1109\/12.42131","article-title":"Generalized measures of fault tolerance with application to n-cube networks","volume":"38","author":"Esfahanian","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0150","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":"1989","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"10.1016\/j.jpdc.2022.09.010_br0160","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."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0170","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s00224-001-1021-7","article-title":"Hamiltonicity of the hierarchical cubic network","volume":"35","author":"Fu","year":"2002","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0180","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1002\/net.10101","article-title":"Fault-tolerant cycle embedding in hierarchical cubic networks","volume":"43","author":"Fu","year":"2004","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0190","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/net.10040","article-title":"Node-disjoint paths and related problems on hierarchical cubic networks","volume":"40","author":"Fu","year":"2002","journal-title":"Networks"},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0200","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.372797","article-title":"Hierarchical cubic networks","volume":"6","author":"Ghose","year":"1995","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0210","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1142\/S0129054120500100","article-title":"On component connectivity of hierarchical star networks","volume":"31","author":"Gu","year":"2020","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"9","key":"10.1016\/j.jpdc.2022.09.010_br0220","doi-asserted-by":"crossref","first-page":"1406","DOI":"10.1093\/comjnl\/bxz088","article-title":"Note on applications of linearly many faults","volume":"63","author":"Gu","year":"2020","journal-title":"Comput. J."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0230","article-title":"Fault diagnosability of regular graphs","volume":"7","author":"Gu","year":"2020","journal-title":"Theory Appl. Graphs"},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0240","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1080\/23799927.2018.1467488","article-title":"Fault-tolerance and diagnosability of hierarchical star networks","volume":"3","author":"Gu","year":"2018","journal-title":"Int. J. Comput. Math. Comput. Syst. Theor."},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0250","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(85)90075-7","article-title":"Neighbor-connectivity in regular graphs","volume":"11","author":"Gunther","year":"1985","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0260","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0166-218X(80)90042-6","article-title":"Optimal k-secure graphs","volume":"2","author":"Gunther","year":"1980","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0270","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/net.3230170208","article-title":"Neighbor-connected graphs and projective planes","volume":"17","author":"Gunther","year":"1987","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.jpdc.2022.09.010_br0280","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"},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0290","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1080\/00207160.2011.638978","article-title":"Component connectivity of the hypercubes","volume":"89","author":"Hsu","year":"2012","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0300","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0045-7906(95)00028-3","article-title":"Sequential diagnosability of star graphs","volume":"22","author":"Kavianpour","year":"1996","journal-title":"Comput. Electr. Eng."},{"key":"10.1016\/j.jpdc.2022.09.010_br0310","series-title":"Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/j.jpdc.2022.09.010_br0320","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.tcs.2016.09.022","article-title":"Embedded connectivity of recursive networks","volume":"653","author":"Li","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jpdc.2022.09.010_br0330","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2018.07.021","article-title":"On conditional fault tolerance of hierarchical cubic networks","volume":"761","author":"Li","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jpdc.2022.09.010_br0340","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.tcs.2016.04.014","article-title":"Structure connectivity and substructure connectivity of hypercubes","volume":"634","author":"Lin","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jpdc.2022.09.010_br0350","author":"Lin"},{"key":"10.1016\/j.jpdc.2022.09.010_br0360","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.dam.2021.01.020","article-title":"On g-good-neighbor conditional connectivity and diagnosability of hierarchical star networks","volume":"293","author":"Liu","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"2019","key":"10.1016\/j.jpdc.2022.09.010_br0370","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2019.04.028","article-title":"On g-extra conditional diagnosability of hierarchical cubic networks","volume":"790","author":"Liu","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jpdc.2022.09.010_br0380","series-title":"IEEE 11th Int. Conf. Trust, Security and Privacy in Computing and Communications, 25-27 June 2012","first-page":"458","article-title":"Subversion impedance in covert communication networks","author":"Nix","year":"2012"},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0390","first-page":"132","article-title":"Neighbourhood failures in covert communication network topologies","volume":"13","author":"Nix","year":"2016","journal-title":"Int. J. Comput. Sci. Eng."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0400","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/s10255-018-0739-9","article-title":"Neighbor connectivity of two kinds of Cayley graphs","volume":"34","author":"Shang","year":"2018","journal-title":"Acta Math. Appl. Sin."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0410","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.sysarc.2004.05.003","article-title":"Hierarchical star: a new two level interconnection network","volume":"51","author":"Shi","year":"2005","journal-title":"J. Syst. Archit."},{"issue":"11","key":"10.1016\/j.jpdc.2022.09.010_br0420","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1016\/j.jpdc.2005.05.005","article-title":"Leader election in hierarchical star network","volume":"65","author":"Shi","year":"2005","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0430","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1080\/17445760.2019.1658193","article-title":"Reliability evaluation of complete cubic networks","volume":"35","author":"Sun","year":"2020","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0440","first-page":"56","article-title":"The restricted neighbor connectivity of line graphs","volume":"47","author":"Wang","year":"2012","journal-title":"J. Shandong Univ. Nat. Sci."},{"issue":"19","key":"10.1016\/j.jpdc.2022.09.010_br0450","doi-asserted-by":"crossref","first-page":"4200","DOI":"10.1016\/j.ins.2007.02.035","article-title":"Node-disjoint paths in hierarchical hypercube networks","volume":"177","author":"Wu","year":"2007","journal-title":"Inf. Sci."},{"key":"10.1016\/j.jpdc.2022.09.010_br0460","series-title":"Combination of Network Theory","author":"Xu","year":"2007"},{"issue":"5","key":"10.1016\/j.jpdc.2022.09.010_br0470","first-page":"625","article-title":"Reliability of complete cubic networks under the condition of g-good-neighbor","volume":"60","author":"Xu","year":"2017","journal-title":"Comput. J."},{"issue":"5","key":"10.1016\/j.jpdc.2022.09.010_br0480","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1109\/TPDS.2018.2874659","article-title":"HSDC: a highly scalable data center network architecture for greater incremental scalability","volume":"30","author":"Zhang","year":"2019","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jpdc.2022.09.010_br0490","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.dam.2020.09.026","article-title":"The generalized 4-connectivity of hierarchical cubic networks","volume":"289","author":"Zhao","year":"2021","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"10.1016\/j.jpdc.2022.09.010_br0500","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1142\/S012905411850017X","article-title":"Component edge connectivity of hypercubes","volume":"29","author":"Zhao","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jpdc.2022.09.010_br0510","first-page":"379","article-title":"Neighbor connectivity of line graphs","volume":"26","author":"Zhao","year":"2009","journal-title":"J. Xinjiang Univ. Nat. Sci."},{"issue":"12","key":"10.1016\/j.jpdc.2022.09.010_br0520","doi-asserted-by":"crossref","first-page":"5508","DOI":"10.1016\/j.amc.2010.12.022","article-title":"Edge neighbor connectivity of Cartesian product graph G\u00d7K2","volume":"217","author":"Zhao","year":"2011","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"10.1016\/j.jpdc.2022.09.010_br0530","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.ipl.2004.09.011","article-title":"Diagnosability of star graphs under the comparison diagnosis model","volume":"93","author":"Zheng","year":"2005","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0540","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.2013.228","article-title":"The t\/k-diagnosability of star graph networks","volume":"64","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/j.jpdc.2022.09.010_br0550","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.tcs.2015.10.030","article-title":"On conditional fault tolerance and diagnosability of hierarchical cubic networks","volume":"609","author":"Zhou","year":"2016","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jpdc.2022.09.010_br0560","series-title":"CRC Standard Probability and Statistics Tables and Formulae","author":"Zwillinger","year":"1999"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731522001988?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731522001988?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T05:13:31Z","timestamp":1709270011000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731522001988"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":56,"alternative-id":["S0743731522001988"],"URL":"https:\/\/doi.org\/10.1016\/j.jpdc.2022.09.010","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2023,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Subversion analyses of hierarchical networks based on (edge) neighbor connectivity","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jpdc.2022.09.010","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}