The Edge Fault-Tolerant Unpaired Two-Disjoint Path Covers of Cayley Graphs Generated by Unicyclic Graphs
Axioms · 19.11.2026 · 15 (11) · 866
DOI: 10.3390/axioms15110866 ↗Kurz gefasst
Fachartikel in der Zeitschrift Axioms, online erschienen am 19.11.2026. Verfasst von Yuwen Lin und 1 weiteren Autor:innen. Die Arbeit nennt 33 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Natural Science Foundation of Xinjiang, China, Xinjiang Tianchi Doctoral Project, China, National Natural Science Foundation of China.
Abstract (Originalsprache)
Let G be a graph and let S,T⊆V(G) be two disjoint vertex subsets with S=T=k. A many-to-many k-disjoint path cover of G is a set of k vertex-disjoint paths, each joining a source in S to a sink in T, whose union covers all vertices of G. The cover is paired if each vertex of S must be joined to a prescribed vertex of T, and unpaired otherwise. Let UGn be an n-dimensional Cayley graph generated by a unicyclic graph with bipartition V0 and V1. Let S⊆V0 and T⊆V1 be two vertex subsets with S=T=2. In this paper, we prove that UGn admits an unpaired many-to-many two-disjoint path cover with at most n−3 faulty edges for n≥3.
Förderung
- Natural Science Foundation of Xinjiang, China
- Xinjiang Tianchi Doctoral Project, China
- National Natural Science Foundation of China
Zitieren
APA
Lin, Y., & Qiao, H. (2026). The Edge Fault-Tolerant Unpaired Two-Disjoint Path Covers of Cayley Graphs Generated by Unicyclic Graphs. Axioms, 15(11), 866. https://doi.org/10.3390/axioms15110866
Vancouver
Lin Y, Qiao H. The Edge Fault-Tolerant Unpaired Two-Disjoint Path Covers of Cayley Graphs Generated by Unicyclic Graphs. Axioms. 2026;15(11):866. doi:10.3390/axioms15110866
BibTeX
@article{Lin2026,
author = {Lin, Yuwen and Qiao, Hongwei},
title = {The Edge Fault-Tolerant Unpaired Two-Disjoint Path Covers of Cayley Graphs Generated by Unicyclic Graphs},
journal = {Axioms},
year = {2026},
volume = {15},
number = {11},
pages = {866},
doi = {10.3390/axioms15110866}
}
EUVIMED