Many-to-many two-disjoint path covers in Cayley graphs generated by unicyclic graphs
Authors:
- Hongwei QiaoHQHongwei Qiao
- Eminjan SabirESEminjan Sabir
- Mingzu ZhangMZMingzu Zhang
- 14 June 2026
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 392, 229-235
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12401467)
- National Natural Science Foundation of China (12261085)
- National Natural Science Foundation of China (12561063)
- Xinjiang Tianchi Doctoral Project
- Natural Science Foundation of Xinjiang Uygur Autonomous Region (2025D01C34)
- Natural Science Foundation of Xinjiang Uygur Autonomous Region (2024D01C38)
- Natural Science Foundation of Xinjiang Uygur Autonomous Region (2024D01C225)
This publication has 34 references indexed in Scilit:
- Unpaired disjoint path covers in bipartite torus-like graphs with edge faultsThe Journal of Supercomputing, 2024
- The spanning cyclability of Cayley graphs generated by transposition treesDiscrete Applied Mathematics, 2022
- Torus-like graphs and their paired many-to-many disjoint path coversDiscrete Applied Mathematics, 2021
- Paired many-to-many two-disjoint path cover of balanced hypercubes with faulty edgesThe Journal of Supercomputing, 2019
- Paired many-to-many disjoint path covers of hypertoriDiscrete Applied Mathematics, 2017
- Many-to-many two-disjoint path covers in cylindrical and toroidal gridsDiscrete Applied Mathematics, 2015
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition treesDiscrete Mathematics, 2012
- Hamiltonian laceability of bubble-sort graphs with edge faultsInformation Sciences, 2007
- Hyper hamiltonian laceability on edge fault star graphInformation Sciences, 2004
- Hamiltonian-laceability of star graphsNetworks, 2000