English

Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes

Combinatorics 2017-05-22 v4

Abstract

The balanced hypercube, BHnBH_n, is a variant of hypercube QnQ_n. R.X. Hao et al. (2014)(2014) \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adjacent vertices in BHnBH_n with (2n2)(2n-2) faulty edges. D.Q. Cheng et al. (2015)(2015) \cite{Dongqincheng2} proved that BHnBH_n is 66-edge-bipancyclic after (2n3)(2n-3) faulty edges occur for all n2n\ge2. In this paper, we improve these two results by demonstrating that BHnBH_n is 66-edge-bipancyclic even when there exist (2n2)(2n-2) faulty edges for all n2n\ge2. Our result is optimal with respect to the maximum number of tolerated edge faults.

Keywords

Cite

@article{arxiv.1606.05152,
  title  = {Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes},
  author = {Pingshan Li and Min Xu},
  journal= {arXiv preprint arXiv:1606.05152},
  year   = {2017}
}