Hamiltonian numbers of Möbius double loop networks

DOI10.1007/S10878-010-9360-4zbMATH Open1245.90131OpenAlexW1988261940MaRDI QIDQ437052FDOQ437052

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

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

Recommendations

• The Hamiltonian numbers in digraphs
• Hamiltonian numbers in oriented graphs
• The Hamiltonian property of generalized de Bruijn digraphs
• The Hamiltonian numbers in graphs.
• Graphs with prescribed order and Hamiltonian number

zbMATH Keywords

Hamiltonian cycledouble loop networkHamiltonian number

Mathematics Subject Classification ID

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

Cites Work

• A Combinatorial Problem Related to Multimodule Memory Organizations
• Title not available (Why is that?)
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• The Hamiltonian number of graphs with prescribed connectivity
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Hamiltonian Number of Cubic Graphs
• Upper Hamiltonian numbers and Hamiltonian spectra of graphs
• A complementary survey on double-loop networks

Cited In (4)

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

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

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