JOURNAL ARTICLE

Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults.

  • Published In: International Journal of Foundations of Computer Science, 2023, v. 34, n. 4. P. 429 1 of 3

  • Database: Academic Search Ultimate 2 of 3

  • Authored By: Park, Jung-Heum 3 of 3

Abstract

Given two disjoint vertex-sets, S = { s 1 , ... , s k } and T = { t 1 , ... , t k } in a graph, a paired many-to-many  k -disjoint path cover joining S and T is a set of pairwise vertex-disjoint paths { P 1 , ... , P k } that altogether cover every vertex of the graph, in which each path P i runs from s i to t i . 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 m -dimensional bipartite torus, m ≥ 3 , with at most 2 m − 4 edge faults has a paired many-to-many 3 -disjoint path cover joining arbitrary disjoint sets S and T of size 3 each such that S ∪ T contains the equal numbers of vertices from different parts of the bipartition. [ABSTRACT FROM AUTHOR]

Additional Information

  • Source:International Journal of Foundations of Computer Science. 2023/06, Vol. 34, Issue 4, p429
  • Document Type:Article
  • Subject Area:Mathematics
  • Publication Date:2023
  • ISSN:0129-0541
  • DOI:10.1142/S0129054122500241
  • Accession Number:163976235
  • Copyright Statement:Copyright of International Journal of Foundations of Computer Science is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.