Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults
International Journal of Foundations of Computer Science · 2023-06 · 34 (04) · 429-441
DOI: 10.1142/s0129054122500241 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Foundations of Computer Science, online erschienen am 09.11.2022. Verfasst von Jung-Heum Park. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 22 Literaturangaben. Gefördert von: National Research Foundation of Korea.
Abstract (Originalsprache)
Given two disjoint vertex-sets, [Formula: see text] and [Formula: see text] in a graph, a paired many-to-many [Formula: see text]-disjoint path cover joining [Formula: see text] and [Formula: see text] is a set of pairwise vertex-disjoint paths [Formula: see text] that altogether cover every vertex of the graph, in which each path [Formula: see text] runs from [Formula: see text] to [Formula: see text]. In this paper, we reveal that a bipartite torus-like graph, if built from lower dimensional torus-like graphs that have good disjoint-path-cover properties, retain such good property. As a result, an [Formula: see text]-dimensional bipartite torus, [Formula: see text], with at most [Formula: see text] edge faults has a paired many-to-many [Formula: see text]-disjoint path cover joining arbitrary disjoint sets [Formula: see text] and [Formula: see text] of size [Formula: see text] each such that [Formula: see text] contains the equal numbers of vertices from different parts of the bipartition.
Förderung
- National Research Foundation of Korea
Zitieren
APA
Park, J. (2023). Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. International Journal of Foundations of Computer Science, 34(04), 429-441. https://doi.org/10.1142/s0129054122500241
Vancouver
Park J. Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults. International Journal of Foundations of Computer Science. 2023;34(04):429-441. doi:10.1142/s0129054122500241
BibTeX
@article{Park2023,
author = {Park, Jung-Heum},
title = {Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults},
journal = {International Journal of Foundations of Computer Science},
year = {2023},
volume = {34},
number = {04},
pages = {429--441},
doi = {10.1142/s0129054122500241}
}
EUVIMED