Cycle and Path Embedding on 5-ary N-cubes

DOI10.1051/ita:2008004zbMath1156.68041OpenAlexW1996015502MaRDI QIDQ3549291

Sun-Yuan Hsieh, Tsong-Jie Lin, Hui-Ling Huang

Publication date: 22 December 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92902

zbMATH Keywords

hypercubesedge-pancyclicitypanconnectivity\(k\)-ary \(n\)-cubesgraph-theoretic interconnection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes ⋮ Edge-fault-tolerant node-pancyclicity of twisted cubes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some remarks about time in Newtonian particle mechanics
• Panconnectivity of locally connected claw-free graphs
• Panconnectivity of locally twisted cubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Lee distance and topological properties of k-ary n-cubes

This page was built for publication: Cycle and Path Embedding on 5-ary N-cubes