The Edge Fault-Tolerant Unpaired Two-Disjoint Path Covers of Cayley Graphs Generated by Unicyclic Graphs
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.
Authors
- Hongwei Qiao (ORCID: https://orcid.org/0000-0002-4189-6726)
- Yuwen Lin
Institutions
- Xinjiang University (CN)
Publication Details
- Journal
- Axioms
- Published
- 2026-11-19
- DOI
- https://doi.org/10.3390/axioms15110866
- Primary Topic
- Interconnection Networks and Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00