Circuits, Communications and Systems, Pacific-Asia Conference on (2009)

Chengdu, China

May 16, 2009 to May 17, 2009

ISBN: 978-0-7695-3614-9

pp: 3-6

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PACCS.2009.8

ABSTRACT

For two vertices x, y ∈ V (G), a cycle is called a geodesic cycle with x and y if a shortest path joining x and y lies on the cycle. A graph G is called to be geodesic k-pancyclic if any two vertices x, y on G have such geodesic cycle of length l that 2dG(x, y) + k ≤ l ≤ |V (G)|. In this paper, we show that the n-dimensional Möbius cube MQn is geodesic 2-pancyclic for n ≥ 3.

INDEX TERMS

Geodesic cycles, Pancyclic, Shortest path, Interconnection networks, Möbius cubes

CITATION

H. Hsu, C. Tsai and P. Lai, "Embed Geodesic Cycles into Möbius Cubes,"

*2009 Pacific-Asia Conference on Circuits, Communications and Systems (PACCS 2009)(PACCS)*, Chengdu, 2009, pp. 3-6.

doi:10.1109/PACCS.2009.8

CITATIONS