On path bipancyclicity of hypercubes

  • Authors:

  • Xie-Bin Chen

  • Affiliations:

  • Department of Mathematics and Information Science, Zhangzhou Teachers College, Zhangzhou, Fujian 363000, China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.89

Visualization

Abstract

Assume that P is any path in a bipartite graph G of length k with 2==3 is (2n-4)-path bipancyclicity. In this paper, counterexamples to the lemma are given, therefore, their proof fails. And we show the following result: The n-cube Q"n with n=3 is (2n-4)-path bipancyclicity but is not (2n-2)-path bipancyclicity, moreover, and a path P of length k with 2=