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

DOI10.1016/J.AMC.2013.03.128MaRDI QIDQ2016337zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• scientific article; zbMATH DE number 1488848
• A lower bound on the number of hamiltonian cycles
• A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
• scientific article; zbMATH DE number 1811355
• scientific article; zbMATH DE number 1185588

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs
• Fault-tolerant Hamiltonian connectedness of cycle composition networks
• Fault-tolerant cycle-embedding of crossed cubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• On some super fault-tolerant Hamiltonian graphs
• Topological properties of the crossed cube architecture

Cited in

(8)

• Paths and cycles identifying vertices in twisted cubes
• Cycles embedding in balanced hypercubes with faulty edges and vertices
• Un nouvel encadrement du nombre de cycle Hamiltoniens du n-cube. (New bounds for the number of Hamiltonian cycles of the n-cube)
• A lower bound for the optimal crossing-free Hamiltonian cycle problem
• A parallel algorithm for constructing two edge-disjoint Hamiltonian cycles in crossed cubes
• Fault-tolerant cycles embedding in hypercubes with faulty edges
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• scientific article; zbMATH DE number 11985 (Why is no real title available?)

This page was built for publication: A lower bound on the number of Hamiltonian cycles through a prescribed edge in a crossed cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2016337)