Hamiltonian Decomposition of Some Interconnection Networks

DOI10.1007/978-3-642-02026-1_21MaRDI QIDQ3637069zbMATH OpenOpenAlexFDO

Authors Panfeng Niu, Haizhong Shi

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_21

zbMATH Keywords

Cayley graphHamiltonian decomposition

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Eulerian and Hamiltonian graphs (05C45) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Recommendations

• Hamiltonian decomposition of Cayley graphs of degree 4
• Hamiltonian decomposition of Cayley graphs of orders \(p^2\) and \(pq\)
• Disjoint Hamilton cycles in transposition graphs
• 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable
• Hamiltonian properties on a class of circulant interconnection networks

Cited in

(6)

• Hamiltonicity of the hierarchical cubic network
• One conjecture of bubble-sort graphs
• Decomposition of star network S₅ into Hamilton cycles
• Hamiltonian Property on Binary Recursive Networks
• Hamiltonian properties on a class of circulant interconnection networks
• Some LCP decompositions of multistage interconnection networks

This page was built for publication: Hamiltonian Decomposition of Some Interconnection Networks

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