Paired 3-disjoint path covers of balanced hypercubes
Combinatorics
2019-12-17 v1
Abstract
The balanced hypercube , proposed by Wu and Huang, is a variation of the hypercube. The paired 1-disjoint path cover of is the Hamiltonian laceability, which was obtained by Xu et al. in [Appl. Math. Comput. 189 (2007) 1393--1401]. The paired 2-disjoint path cover of was obtained by Cheng et al. in [Appl. Math. and Comput. 242 (2014) 127-142]. In this paper, we obtain the paired 3-disjoint path cover of with . This result improves the above known results about the paired -disjoint path covers of for .
Cite
@article{arxiv.1912.07070,
title = {Paired 3-disjoint path covers of balanced hypercubes},
author = {Mei-Rong Guo and Rong-Xia Hao and Mei-Mei Gu},
journal= {arXiv preprint arXiv:1912.07070},
year = {2019}
}
Comments
15 pages, 5 figures. The work was included in the MS thesis of the author Mei-Rong Guo in [Path Cover and Fault-tolerant Cycle Embedding Analysis of Some Networks, MS Thesis at Beijing Jiaotong University, China, June 2016]