{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:08Z","timestamp":1781463308746,"version":"3.54.1"},"reference-count":30,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.05.002","type":"journal-article","created":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T14:27:29Z","timestamp":1779805649000},"page":"496-510","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Sharp bounds and characterizations for cut-component numbers of graphs"],"prefix":"10.1016","volume":"391","author":[{"given":"Ji","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuefang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junran","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemei","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"18","key":"10.1016\/j.dam.2026.05.002_b1","doi-asserted-by":"crossref","first-page":"3464","DOI":"10.1016\/j.dam.2008.02.001","article-title":"On diagnosability of large multiprocessor networks","volume":"156","author":"Ahlswede","year":"2008","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.05.002_b2","series-title":"Recent Trends in Graph Theory","first-page":"1","article-title":"Connectivity and line connectivity of complementary graphs","author":"Alavi","year":"1970"},{"issue":"4\u20135","key":"10.1016\/j.dam.2026.05.002_b3","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/j.dam.2011.12.018","article-title":"A survey of Nordhaus-Gaddum type relations","volume":"161","author":"Aouchiche","year":"2013","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2026.05.002_b4","first-page":"465","article-title":"Diagnosability of networks represented by the Cartesian product","volume":"E83-A","author":"Araki","year":"2000","journal-title":"IEICE Trans. Fundam."},{"issue":"8","key":"10.1016\/j.dam.2026.05.002_b5","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1109\/TC.1981.1675844","article-title":"Fault diagnosis in a boolean n cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/j.dam.2026.05.002_b6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/152610.152612","article-title":"The consensus problem in fault tolerant computing","volume":"25","author":"Barborak","year":"1993","journal-title":"ACM Comput. Surv."},{"issue":"3","key":"10.1016\/j.dam.2026.05.002_b7","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/12.127443","article-title":"Complexity of fault diagnosis in comparison models","volume":"41","author":"Blough","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/j.dam.2026.05.002_b8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/S0196-6774(02)00250-X","article-title":"Diagnosability of regular systems","volume":"45","author":"Caruso","year":"2002","journal-title":"J. Algorithms"},{"key":"10.1016\/j.dam.2026.05.002_b9","series-title":"From Parallel to Emergent Computing","first-page":"77","article-title":"Structural properties and fault resiliency of interconnection networks","author":"Cheng","year":"2019"},{"issue":"2","key":"10.1016\/j.dam.2026.05.002_b10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","article-title":"A note on Hamiltonian circuits","volume":"2","author":"Chv\u00e1tal","year":"1972","journal-title":"Discret. Math."},{"issue":"6","key":"10.1016\/j.dam.2026.05.002_b11","first-page":"412","article-title":"On fault identification in diagnosable systems","volume":"30","author":"Chwa","year":"1981","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/j.dam.2026.05.002_b12","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TC.1984.1676472","article-title":"An O(n2.5) faulty identification algorithm for diagnosable systems","volume":"33","author":"Dahbura","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2026.05.002_b13","doi-asserted-by":"crossref","unstructured":"L. Ford, D. Fulkerson, Maximal flow through a network, Canad. J. Math. 1956.","DOI":"10.4153\/CJM-1956-045-5"},{"key":"10.1016\/j.dam.2026.05.002_b14","unstructured":"A.D. Friedman, A New Measure of Digital System Diagnosis, in: Proc. 1975 Int\u2019l Symp. Fault-Tolerant Computing, 1975, pp. 167\u2013170."},{"issue":"1","key":"10.1016\/j.dam.2026.05.002_b15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/T-C.1974.223782","article-title":"Characterization of connection assignment of diagnosable aystems","volume":"23","author":"Hakimi","year":"1974","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2026.05.002_b16","series-title":"Algorithm Design","author":"Kleinberg","year":"2005"},{"key":"10.1016\/j.dam.2026.05.002_b17","doi-asserted-by":"crossref","unstructured":"M. Kobayashi, T. Takabatake, T. Matsushima, S. Hirasawa, Probabilistic fault diagnosis and its analysis in multicomputer systems, in: 2011 IEEE International Conference on Systems, Man, and Cybernetics, 2011, pp. 1205\u20131211.","DOI":"10.1109\/ICSMC.2011.6083862"},{"issue":"3","key":"10.1016\/j.dam.2026.05.002_b18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1142\/S0218126694000156","article-title":"A simple discriminator for identifying faults in highly structured diagnosable systems","volume":"4","author":"Kohda","year":"1994","journal-title":"J. Circuits Syst. Comput."},{"issue":"2","key":"10.1016\/j.dam.2026.05.002_b19","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TC.2005.19","article-title":"Conditional diagnosability measure for large multiprocessors systems","volume":"54","author":"Lai","year":"2005","journal-title":"IEEE Trans. Comput."},{"issue":"6","key":"10.1016\/j.dam.2026.05.002_b20","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1109\/TC.1978.1675147","article-title":"Diagnosable systems for intermittent faults","volume":"27","author":"Mallela","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"10.1016\/j.dam.2026.05.002_b21","doi-asserted-by":"crossref","first-page":"934","DOI":"10.1109\/TC.1980.1675479","article-title":"System diagnosis with repair","volume":"29","author":"Manber","year":"1980","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2026.05.002_b22","series-title":"The structure of minimum vertex cuts","author":"Pettie","year":"2021"},{"issue":"6","key":"10.1016\/j.dam.2026.05.002_b23","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/PGEC.1967.264748","article-title":"On the connection assignment problem of diagnosable systems","volume":"EC-16","author":"Preparata","year":"1967","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"5","key":"10.1016\/j.dam.2026.05.002_b24","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TC.1987.1676938","article-title":"A generalized theory for system level diagnosis","volume":"36","author":"Somani","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/j.dam.2026.05.002_b25","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1109\/12.536232","article-title":"On diagnosability of large fault sets in regular topology-based computer systems","volume":"45","author":"Somani","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.dam.2026.05.002_b26","unstructured":"Z. Wang, L. Zhang, S. Miao, Y. Mao, S.-Y. Hsieh, X. Zhang, A new method for computing the diagnosability of general networks under the PMC model, submitted for publication."},{"key":"10.1016\/j.dam.2026.05.002_b27","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.tcs.2017.07.031","article-title":"On g-good-neighbor conditional diagnosability of (n,k)-star networks","volume":"697","author":"Wei","year":"2017","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.dam.2026.05.002_b28","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s40305-017-0166-2","article-title":"The g-good-neighbor conditional diagnosability of locally twisted cubes","volume":"6","author":"Wei","year":"2018","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.dam.2026.05.002_b29","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.tcs.2016.11.007","article-title":"The g-good-neighbor diagnosability of (n,k)-star graphs","volume":"659","author":"Xu","year":"2017","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/j.dam.2026.05.002_b30","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/TPDS.2014.2318305","article-title":"The g-good-neighbor conditional diagnosability of k-ary n-cubes under the PMC Model and MM\u2217 Model","volume":"26","author":"Yuan","year":"2015","journal-title":"IEEE Trans Parall. Distr. Syst."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600288X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600288X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:08:16Z","timestamp":1781460496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600288X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":30,"alternative-id":["S0166218X2600288X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.002","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Sharp bounds and characterizations for cut-component numbers of graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.05.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}