On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes

DOI

10.2991/jcis.2006.204How to use a DOI?

Keywords

Interconnection network; Crossed cube; disjoint path; k-equal-disjoint path cover, 2-equal-disjoint path coverable

Abstract

Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph $G$ is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices $(u, v)$ and $(w, x)$ of $G$, there exist two disjoint paths $P$ and $Q$ satisfied that $(1)$ $P$ joins $u$ to $v$ and $Q$ joins $w$ to $x$, $(2)$ $|P|=|Q|$, and $(3)$ $V(P\cup Q)=V(G)$. In this paper, we prove that $CQ_n$ is globally 2-equal-disjoint path coverable for $n \ge 5$.

Copyright

© 2006, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Pao-Lien Lai
AU  - Hong-Chun Hsu
PY  - 2006/10
DA  - 2006/10
TI  - On the Two-Equal-Disjoint Path Cover Problem of Crossed Cubes
BT  - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06)
PB  - Atlantis Press
SP  - 476
EP  - 479
SN  - 1951-6851
UR  - https://doi.org/10.2991/jcis.2006.204
DO  - 10.2991/jcis.2006.204
ID  - Lai2006/10
ER  -