This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 Pacific-Asia Conference on Circuits, Communications and Systems
Embed Geodesic Cycles into Möbius Cubes
Chengdu, China
May 16-May 17
ISBN: 978-0-7695-3614-9
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:
Chang-Hsiung Tsai, Pao-Lien Lai, Hong-Chun Hsu, "Embed Geodesic Cycles into Möbius Cubes," paccs, pp.3-6, 2009 Pacific-Asia Conference on Circuits, Communications and Systems, 2009
Usage of this product signifies your acceptance of the Terms of Use.