{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T13:23:07Z","timestamp":1774099387692,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"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,5]]},"DOI":"10.1016\/s0166-218x(01)00234-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T07:09:17Z","timestamp":1027580957000},"page":"163-179","source":"Crossref","is-referenced-by-count":28,"title":["Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness"],"prefix":"10.1016","volume":"118","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Marc J.","family":"Lipman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00234-7_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, Proceedings of the International Conference on Parallel Processing, 1987, pp. 393\u2013400."},{"issue":"4","key":"10.1016\/S0166-218X(01)00234-7_BIB2","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."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB3","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TC.1981.1675844","article-title":"Fault diagnosis in boolean n-cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB4","first-page":"39","article-title":"A characterization of vertex-transitive graphs of toughness one","volume":"10","author":"Bagga","year":"1994","journal-title":"Bull. Inst. Combin. Appl."},{"issue":"5","key":"10.1016\/S0166-218X(01)00234-7_BIB5","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1109\/71.382321","article-title":"A well-behaved enumeration of star graphs","volume":"6","author":"Bagherzadeh","year":"1995","journal-title":"IEEE Trans. Parallel Dist. Systems"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB6","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0167-6377(92)90045-5","article-title":"Separating from the dominant of the spanning tree polytope","volume":"12","author":"Barahona","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","article-title":"Recognizing tough graphs is np-hard","volume":"28","author":"Bauer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0166-218X(92)90002-R","article-title":"Fractional arboricity, strength, and principal partitions in graphs and matroids","volume":"40","author":"Catlin","year":"1992","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"10.1016\/S0166-218X(01)00234-7_BIB9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/71.508251","article-title":"Balanced spanning trees in complete and incomplete star graphs","volume":"7","author":"Chen","year":"1996","journal-title":"IEEE Trans. Parallel Dist. Systems"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(94)90013-2","article-title":"A faster algorithm for computing the strength of a network","volume":"49","author":"Cheng","year":"1994","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB11","unstructured":"E. Cheng, M.J. Lipman, Vulnerability issues of some interconnection network, Technical Report number 98-4, Oakland University, 1998."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB12","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0020-0190(99)00155-6","article-title":"On the Day\u2013Tripathi orientation of the star graphs: connectivity","volume":"73","author":"Cheng","year":"2000","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB13","first-page":"107","article-title":"Super connectivity of star graphs, alternating group graphs and split-stars","volume":"59","author":"Cheng","year":"2001","journal-title":"Ars Combin."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB14","unstructured":"E. Cheng, M.J. Lipman, H.A. Park, An attractive variation of the star graphs: split-stars, Technical Report number 98-3, Oakland University, 1998."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB15","first-page":"23","article-title":"Tough graphs and hamiltonian circuits","volume":"8","author":"Chv\u00e1tal","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/3828.3829","article-title":"Optimal attack and reinforcement of a network","volume":"32","author":"Cunningham","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(93)90013-Y","article-title":"Unidirectional star graphs","volume":"45","author":"Day","year":"1993","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB18","series-title":"Combinatorial Structures and their Applications","first-page":"69","article-title":"Submodular functions, matroids, and certain polyhedra","author":"Edmonds","year":"1970"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(83)90031-5","article-title":"Connectivity and edge disjoint spanning trees","volume":"16","author":"Gusfield","year":"1983","journal-title":"Inform. Proc. Lett."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230230414","article-title":"A new class of interconnection networks based on the alternating group","volume":"23","author":"Jwo","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB21","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"issue":"4","key":"10.1016\/S0166-218X(01)00234-7_BIB22","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/71.149958","article-title":"Optimal broadcasting on the star graphs","volume":"3","author":"Mendia","year":"1992","journal-title":"IEEE Trans. Parallel Dist. Systems"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB23","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge disjoint spanning trees in finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB24","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TC.1977.1674863","article-title":"The indirect binary n-cube microprocessor array","volume":"26","author":"Pease","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB25","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercubes","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB26","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/2465.2467","article-title":"The cosmic cube","volume":"28","author":"Seitz","year":"1985","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB27","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0190(93)90119-T","article-title":"The 4-star graph is not a subgraph of any hypercube","volume":"37","author":"Shen","year":"1993","journal-title":"Inform. Proc. Lett."},{"issue":"6","key":"10.1016\/S0166-218X(01)00234-7_BIB28","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1109\/71.388046","article-title":"An optimal broadcasting algorithm without message redundancy in star graphs","volume":"6","author":"Sheu","year":"1995","journal-title":"IEEE Trans. Parallel Dist. Systems"},{"key":"10.1016\/S0166-218X(01)00234-7_BIB29","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factor","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(01)00234-7_BIB30","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0021-9800(70)80005-9","article-title":"Connectivity of transitive graphs","volume":"8","author":"Watkins","year":"1970","journal-title":"J. Comb. Theory"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T01:29:56Z","timestamp":1556760596000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0166218X01002347"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00234-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}