{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T13:05:08Z","timestamp":1753880708178,"version":"3.41.2"},"reference-count":19,"publisher":"World Scientific Pub Co Pte Ltd","issue":"03n04","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772010"],"award-info":[{"award-number":["61772010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanxi Provincial Fundamental Research Program of China","award":["202203021221128"],"award-info":[{"award-number":["202203021221128"]}]},{"name":"The Doctoral Scientific Research fund of Inner Mongolia Minzu University","award":["BSZ013"],"award-info":[{"award-number":["BSZ013"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:p> Parallel paths of interconnection networks have attracted much attention in parallel computing systems, they are studied in terms of disjoint paths in an undirected graph [Formula: see text]. A [Formula: see text]-disjoint path cover (k-DPC for short) of a graph [Formula: see text] is a set of [Formula: see text] (internally) disjoint paths that altogether cover every vertice of the graph. A bipartite graph [Formula: see text] is one-to-one bi-k-DPC if there is a k-DPC between any pair of vertices in different partite sets. A bipartite graph is hamiltonian laceable if there exists a hamiltonian path between any pair of vertices in different partite sets. The [Formula: see text]-dimensional leaf-sort graph [Formula: see text] has many good properties, including bipartite, symmetry, vertex-transitive. In this paper, we prove that [Formula: see text] has one-to-one bi-[Formula: see text]-DPC between any two vertices [Formula: see text] and [Formula: see text] in [Formula: see text], where [Formula: see text], [Formula: see text] in different partite sets, and [Formula: see text] is hamiltonian laceable. <\/jats:p>","DOI":"10.1142\/s0129626424500105","type":"journal-article","created":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T03:15:46Z","timestamp":1731294946000},"source":"Crossref","is-referenced-by-count":0,"title":["One-to-one Disjoint-path Covers of Leaf-sort Graphs"],"prefix":"10.1142","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9335-3005","authenticated-orcid":false,"given":"Shiying","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan, Shanxi 030031, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5251-5553","authenticated-orcid":false,"given":"Huanhuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan, Shanxi 030031, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8467-2370","authenticated-orcid":false,"given":"Lina","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan, Shanxi 030031, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7481-2093","authenticated-orcid":false,"given":"Wei","family":"Feng","sequence":"additional","affiliation":[{"name":"Institute of Discrete Mathematics, College of Mathematics and Physics, Inner Mongolia University for Nationalities, Tongliao 028043, P.R. China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2024,11,11]]},"reference":[{"volume-title":"Graph Theory","year":"2007","author":"Bondy J. A.","key":"S0129626424500105BIB001"},{"key":"S0129626424500105BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-023-05256-6"},{"key":"S0129626424500105BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.12.006"},{"key":"S0129626424500105BIB004","doi-asserted-by":"publisher","DOI":"10.1109\/71.615436"},{"key":"S0129626424500105BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114327"},{"key":"S0129626424500105BIB006","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"S0129626424500105BIB007","first-page":"249","volume-title":"NSDI","volume":"10","author":"Heller B.","year":"2010"},{"key":"S0129626424500105BIB008","first-page":"128262","volume":"459","author":"He Y.","year":"2023","journal-title":"Appl. Math. Comput."},{"key":"S0129626424500105BIB009","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.940334"},{"key":"S0129626424500105BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.02.003"},{"key":"S0129626424500105BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.01.019"},{"key":"S0129626424500105BIB012","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3226687"},{"key":"S0129626424500105BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.035"},{"key":"S0129626424500105BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-02817-6"},{"key":"S0129626424500105BIB015","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626420400046"},{"key":"S0129626424500105BIB016","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265919400073"},{"key":"S0129626424500105BIB017","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2024.104887"},{"key":"S0129626424500105BIB018","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265920500115"},{"key":"S0129626424500105BIB019","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.04.002"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626424500105","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T14:47:24Z","timestamp":1732978044000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S0129626424500105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9]]},"references-count":19,"journal-issue":{"issue":"03n04","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1142\/S0129626424500105"],"URL":"https:\/\/doi.org\/10.1142\/s0129626424500105","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"type":"print","value":"0129-6264"},{"type":"electronic","value":"1793-642X"}],"subject":[],"published":{"date-parts":[[2024,9]]},"article-number":"2450010"}}