A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube

DOI10.1016/j.amc.2013.03.128zbMath1290.05096OpenAlexW2030148558MaRDI QIDQ2016337

Chang-Hsiung Tsai, Chia-Jui Lai, Pao-Lien Lai, Jheng-Cheng Chen

Publication date: 20 June 2014

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2013.03.128

zbMATH Keywords

Hamiltonianinterconnection networklinear-time algorithmcrossed cubesprescribed edgereflected sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items

Paths and cycles identifying vertices in twisted cubes, Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes, Cycles embedding in balanced hypercubes with faulty edges and vertices, Fault-tolerant cycles embedding in hypercubes with faulty edges

Cites Work

• Unnamed Item
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Fault-tolerant cycle-embedding of crossed cubes
• Topological properties of the crossed cube architecture
• On some super fault-tolerant Hamiltonian graphs
• Fault-tolerant Hamiltonian connectedness of cycle composition networks
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs