{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:15:19Z","timestamp":1773818119456,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100009996","name":"Shaanxi Province Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2024BSHSDZZ155"],"award-info":[{"award-number":["2024BSHSDZZ155"]}],"id":[{"id":"10.13039\/501100009996","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["GK202506024"],"award-info":[{"award-number":["GK202506024"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12501492"],"award-info":[{"award-number":["12501492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12125106"],"award-info":[{"award-number":["12125106"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFA1010201"],"award-info":[{"award-number":["2023YFA1010201"]}],"id":[{"id":"10.13039\/501100012166","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,1]]},"DOI":"10.1016\/j.dam.2025.10.036","type":"journal-article","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T19:03:49Z","timestamp":1761591829000},"page":"727-735","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Edge-disjoint Hamilton cycles in the McKay\u2013Miller\u2013\u0160ir\u00e1\u0148 graphs"],"prefix":"10.1016","volume":"379","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7070-1174","authenticated-orcid":false,"given":"Xihe","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiheng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2025.10.036_b1","series-title":"Cayley graphs of order 8pq are hamiltonian","author":"Abedi","year":"2023"},{"key":"10.1016\/j.dam.2025.10.036_b2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0012-365X(84)90041-4","article-title":"Research problem 59","volume":"50","author":"Alspach","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.10.036_b3","first-page":"7","article-title":"The wonderful Walecki construction","volume":"52","author":"Alspach","year":"2008","journal-title":"Bull. Inst. Combin. Appl."},{"key":"10.1016\/j.dam.2025.10.036_b4","series-title":"Summer Research Workshop in Algebraic Combinatorics","article-title":"Problem 17, unsolved problems","author":"Babai","year":"1979"},{"key":"10.1016\/j.dam.2025.10.036_b5","series-title":"Handbook of Combinatorics","first-page":"1447","article-title":"Automorphism groups, isomorphism, reconstruction","author":"Babai","year":"1995"},{"key":"10.1016\/j.dam.2025.10.036_b6","series-title":"Selected Topics in Graph Theory","first-page":"127","article-title":"Hamiltonian graphs","author":"Bermond","year":"1978"},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0095-8956(89)90040-3","article-title":"Hamiltonian decomposition of Cayley graphs of degree 4","volume":"46","author":"Bermond","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b8","series-title":"SC\u201914: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"348","article-title":"Slim fly: A cost effective low-diameter network topology","author":"Besta","year":"2014"},{"key":"10.1016\/j.dam.2025.10.036_b9","series-title":"Proceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation","first-page":"1025","article-title":"A high-performance design, implementation, deployment, and evaluation of the slim fly network","author":"Blach","year":"2024"},{"key":"10.1016\/j.dam.2025.10.036_b10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.jctb.2015.05.007","article-title":"Vertex-transitive graphs that have no Hamilton decomposition","volume":"114","author":"Bryant","year":"2015","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b11","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/j.jctb.2019.08.003","article-title":"Approximate Moore graphs are good expanders","volume":"141","author":"Dinitz","year":"2020","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b12","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.dam.2025.02.033","article-title":"Hamilton cycles in vertex-transitive graphs of order 6p","volume":"368","author":"Du","year":"2025","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/j.dam.2025.10.036_b13","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1002\/jgt.22840","article-title":"Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups","volume":"101","author":"Erde","year":"2022","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/j.dam.2025.10.036_b14","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/net.3230100109","article-title":"Maximum degree in graphs of diameter 2","volume":"10","author":"Erd\u0151s","year":"1980","journal-title":"Networks"},{"key":"10.1016\/j.dam.2025.10.036_b15","series-title":"Bringing HPC techniques to deep learning","author":"Gibiansky","year":"2017"},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jctb.2003.07.002","article-title":"Geometric realisation of the graphs of McKay-Miller-\u0160ir\u00e1\u0148","volume":"90","author":"Hafner","year":"2004","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b17","series-title":"2017 46th International Conference on Parallel Processing Workshops","first-page":"155","article-title":"Improving valiant routing for slim fly networks","author":"Han","year":"2017"},{"key":"10.1016\/j.dam.2025.10.036_b18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2014.09.006","article-title":"The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks","volume":"181","author":"Hung","year":"2015","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2025.10.036_b19","series-title":"Optimized inter-gpu collective operations with NCCL 2","author":"Jeaugey","year":"2017"},{"issue":"17","key":"10.1016\/j.dam.2025.10.036_b20","doi-asserted-by":"crossref","first-page":"5491","DOI":"10.1016\/j.disc.2009.02.017","article-title":"Hamilton cycles and paths in vertex-transitive graphs\u2013Current directions","volume":"309","author":"Kutnar","year":"2009","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2025.10.036_b21","series-title":"Finite Fields","volume":"vol. 20","author":"Lidl","year":"1997"},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b22","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/S0095-8956(03)00033-9","article-title":"Hamiltonian decompositions of Cayley graphs on abelian groups of even order","volume":"88","author":"Liu","year":"2003","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b23","series-title":"Proc. Calgary Internat. Conf. Calgary, Alberta, 1969","first-page":"243","article-title":"Combinatorial structures and their applications","author":"Lov\u00e1sz","year":"1970"},{"key":"10.1016\/j.dam.2025.10.036_b24","series-title":"Recr\u00e9ations Math\u00e9matiques, II","author":"Lucas","year":"1892"},{"issue":"1","key":"10.1016\/j.dam.2025.10.036_b25","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1006\/jctb.1998.1828","article-title":"A note on large graphs of diameter two and given maximum degree","volume":"74","author":"McKay","year":"1998","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b26","first-page":"DS14","article-title":"Moore graphs and beyond: a survey of the degree\/diameter problem","author":"Miller","year":"2005","journal-title":"Electron. J. Comb. Dyn. Surv."},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b27","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.jpdc.2008.09.002","article-title":"Bandwidth optimal all-reduce algorithms for clusters of workstations","volume":"69","author":"Patarasuk","year":"2009","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.dam.2025.10.036_b28","series-title":"Proceedings of the 47th International Conference on Parallel Processing","first-page":"1","article-title":"Load-balanced slim fly networks","author":"Rahman","year":"2018"},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b29","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1006\/jctb.2000.2006","article-title":"A note on the McKay-Miller-\u0160ir\u00e1\u0148 graphs","volume":"81","author":"\u0160iagiov\u00e1","year":"2001","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2025.10.036_b30","series-title":"Proceedings of the 20th USENIX Symposium on Networked Systems Design and Implementation","first-page":"739","article-title":"TopoOpt: Co-optimizing network topology and parallelization strategy for distributed training jobs","author":"Wang","year":"2023"},{"key":"10.1016\/j.dam.2025.10.036_b31","series-title":"Proceedings of the 2016 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation","first-page":"189","article-title":"Modeling a million-node slim fly network using parallel discrete-event simulation","author":"Wolfe","year":"2016"},{"issue":"2","key":"10.1016\/j.dam.2025.10.036_b32","doi-asserted-by":"crossref","DOI":"10.1002\/cpe.4441","article-title":"Head-of-line blocking avoidance in slim fly networks using deadlock-free non-minimal and adaptive routing","volume":"31","author":"Y\u00e9benes","year":"2019","journal-title":"Concurr. Comput.: Pr. Exp."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25006134?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X25006134?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T06:13:09Z","timestamp":1773814389000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X25006134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":32,"alternative-id":["S0166218X25006134"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.036","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge-disjoint Hamilton cycles in the McKay\u2013Miller\u2013\u0160ir\u00e1\u0148 graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2025.10.036","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}