Hamiltonian numbers of Möbius double loop networks

DOI10.1007/s10878-010-9360-4zbMath1245.90131OpenAlexW1988261940MaRDI QIDQ437052

Ting-Pang Chang, Li-Da Tong, Gerard Jennhwa Chang

Publication date: 17 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/242277/-1/05.pdf

zbMATH Keywords

Hamiltonian cycledouble loop networkHamiltonian number

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (4)

On the Hamiltonian number of a plane graph ⋮ Hamiltonian numbers in oriented graphs ⋮ The Hamiltonian numbers in digraphs ⋮ Hamiltonian spectra of graphs

Cites Work

• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• A Combinatorial Problem Related to Multimodule Memory Organizations
• The Hamiltonian Number of Cubic Graphs
• A complementary survey on double-loop networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian numbers of Möbius double loop networks