On path bipancyclicity of hypercubes

https://doi.org/10.1016/j.ipl.2009.02.009Get rights and content

Abstract

Assume that P is any path in a bipartite graph G of length k with 2kh, G is said to be h-path bipancyclic if there exists a cycle C in G of every even length from 2k to |V(G)| such that P lies in C. Based on Lemma 5, the authors of [C.-H. Tsai, S.-Y. Jiang, Path bipancyclicity of hypercubes, Inform. Process. Lett. 101 (2007) 93–97] showed that the n-cube Qn with n3 is (2n4)-path bipancyclicity. In this paper, counterexamples to the lemma are given, therefore, their proof fails. And we show the following result: The n-cube Qn with n3 is (2n4)-path bipancyclicity but is not (2n2)-path bipancyclicity, moreover, and a path P of length k with 2k2n4 lies in a cycle of length 2k2 if and only if P contains two edges of dimension i for some i, 1in. We conjecture that if 2n4 is replaced by 2n3, then the above result also holds.

References (14)

There are more references available in the full text version of this article.

Cited by (0)

The work was supported by NNSF of China (No. 10671191).

View full text