{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:03Z","timestamp":1781463303883,"version":"3.54.1"},"reference-count":33,"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\/501100006407","name":"Henan Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006407","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.04.037","type":"journal-article","created":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T20:10:52Z","timestamp":1778616652000},"page":"114-121","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Girth tenacity of some cube-like networks"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0755-1764","authenticated-orcid":false,"given":"Yuxing","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shu-Li","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.dam.2026.04.037_b1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.dam.2010.10.003","article-title":"Superconnectivity of graphs with odd girth g and even girth h","volume":"159","author":"Balbuena","year":"2011","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.037_b2","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/s00453-023-01181-5","article-title":"Token sliding on graphs of girth five","volume":"86","author":"Bartier","year":"2024","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.04.037_b3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0890-5401(88)90056-9","article-title":"How robust is the n-cube?","volume":"77","author":"Becker","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.dam.2026.04.037_b4","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.dam.2026.04.037_b5","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/jgt.3190190104","article-title":"On the maximum number of edges in a C4-free subgraph of Qn","volume":"19","author":"Brass","year":"1995","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.037_b6","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/jgt.3190160311","article-title":"Subgraphs of a hypercube containing no small even cycles","volume":"16","author":"Chung","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.037_b7","first-page":"97","article-title":"On the characterization of the maximum squareless subgraphs of 5-cube","volume":"88","author":"Emamy-K.","year":"1992","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2026.04.037_b8","doi-asserted-by":"crossref","DOI":"10.1090\/tran\/9435","article-title":"On a solution of the multidimensional truncated moment problem on vertices of the hypercube based on bell inequalities","author":"Emary","year":"2025","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/j.dam.2026.04.037_b9","series-title":"Graph Theory and Combinatorics (Cambridge, 1983)","first-page":"1","article-title":"On some problems in graph theory, combinatorial analysis and com binatorial number theory","author":"Erd\u00f6s","year":"1984"},{"key":"10.1016\/j.dam.2026.04.037_b10","first-page":"389","article-title":"Link failure tolerance in k-ary n-cubes","volume":"36","author":"Feng","year":"2013","journal-title":"J. Shanxi Univ. (Nat. Sci. Ed.)"},{"issue":"7","key":"10.1016\/j.dam.2026.04.037_b11","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1109\/LCOMM.2013.052013.130474","article-title":"Column-weight three QC LDPC codes with girth 20","volume":"17","author":"Gholami","year":"2013","journal-title":"IEEE Commun. Lett."},{"key":"10.1016\/j.dam.2026.04.037_b12","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/inco.1993.1010","article-title":"Subcube fault-tolerance in hypercubes","volume":"102","author":"Graham","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.dam.2026.04.037_b13","first-page":"55","article-title":"Maximum number of edges in a six-cube without four-cycles","volume":"12","author":"Harborth","year":"1994","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.dam.2026.04.037_b14","doi-asserted-by":"crossref","first-page":"2697","DOI":"10.1007\/s00453-021-00833-8","article-title":"Connectivity keeping trees in 2-connected graphs with girth conditions","volume":"83","author":"Hasunuma","year":"2021","journal-title":"Algorithmica"},{"key":"10.1016\/j.dam.2026.04.037_b15","first-page":"949","article-title":"Induced subgraphs of hypercubes and a proof of the sensitivity conjecture","volume":"199","author":"Huang","year":"2019","journal-title":"Ann. Math."},{"key":"10.1016\/j.dam.2026.04.037_b16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/0095-8956(89)90054-3","article-title":"Largest induced subgraphs of the n-cube that contain no 4-cycles","volume":"46","author":"Johnson","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.04.037_b17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.dam.2022.01.015","article-title":"The vertex Tur\u00e1n density in 3-ary n-cubes","volume":"311","author":"Li","year":"2022","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"10.1016\/j.dam.2026.04.037_b18","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1109\/TPDS.2005.113","article-title":"The exchanged hypercube","volume":"16","author":"Loh","year":"2005","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.dam.2026.04.037_b19","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1142\/S0129054121500131","article-title":"An exchanged 3-ary n-cube interconnection network for parallel computation","volume":"32","author":"Lv","year":"2021","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.037_b20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jpdc.2021.07.020","article-title":"Exponential type of many-to-many edge disjoint paths on ternary n-cubes","volume":"158","author":"Ma","year":"2021","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.dam.2026.04.037_b21","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.tcs.2022.05.003","article-title":"Connectivity and super connectivity of the exchanged 3-ary n-cube","volume":"923","author":"Ning","year":"2022","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.dam.2026.04.037_b22","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TIT.2005.862120","article-title":"Algebraic construction of sparse matrices with large girth","volume":"52","author":"O\u2019Sullivan","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2026.04.037_b23","doi-asserted-by":"crossref","DOI":"10.1103\/bz43-x4cg","article-title":"Random cubic graph embedded in a hypercube: Entanglement spectrum and many-body localization","volume":"112","author":"Slanina","year":"2025","journal-title":"Phys. Rev. B"},{"issue":"1","key":"10.1016\/j.dam.2026.04.037_b24","first-page":"14","article-title":"Symmetrical constructions for regular girth-8 QC-LDPC codes","volume":"65","author":"Tasdighi","year":"2017","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.dam.2026.04.037_b25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.2021.3116655","article-title":"Integer ring sieve for constructing compact QC-LDPC codes with girths 8, 10, and 12","volume":"68","author":"Tasdighi","year":"2022","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dam.2026.04.037_b26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tcs.2012.06.013","article-title":"Fault tolerance in k-ary n-cube networks","volume":"460","author":"Wang","year":"2012","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/j.dam.2026.04.037_b27","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/TR.2021.3089466","article-title":"An O(log3N) algorithm for reliability assessment of 3-ary n-cubes based on h-extra edge connectivity","volume":"71","author":"Xu","year":"2022","journal-title":"IEEE Trans. Reliab."},{"key":"10.1016\/j.dam.2026.04.037_b28","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.tcs.2021.04.016","article-title":"Embedded connectivity of ternary n-cubes","volume":"871","author":"Yang","year":"2021","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.037_b29","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.dam.2025.07.006","article-title":"Optimality for the restricted edge connectivity in exchanged ternary n-cubes","volume":"378","author":"Yang","year":"2026","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.037_b30","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.tcs.2016.01.046","article-title":"g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks","volume":"626","author":"Yuan","year":"2016","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.037_b31","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.dam.2018.07.027","article-title":"Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected","volume":"255","author":"Zhang","year":"2019","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.dam.2026.04.037_b32","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1093\/comjnl\/bxad012","article-title":"The cyclic diagnosability of hypercubes under the PMC model and the MM* model","volume":"67","author":"Zhang","year":"2023","journal-title":"Comput. J."},{"key":"10.1016\/j.dam.2026.04.037_b33","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.dam.2023.07.013","article-title":"Reliability analysis of 3-ary n-cube in terms of average degree edge-connectivity","volume":"341","author":"Zhang","year":"2023","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600260X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X2600260X?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:07:50Z","timestamp":1781460470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2600260X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":33,"alternative-id":["S0166218X2600260X"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.037","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":"Girth tenacity of some cube-like networks","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.037","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"}]}}