Abstract
For the study of hamiltonicity of graphs and digraphs, Goodman and Hedetniemi introduced the concept of Hamiltonian number. The Hamiltonian number h(D) of a digraph D is the minimum length of a closed walk containing all vertices of D. In this paper, we study Hamiltonian numbers of the following proposed networks, which include strongly connected double loop networks. For integers d≥1, m≥1 and ℓ≥0, the Möbius double loop network MDL(d,m,ℓ) is the digraph with vertex set {(i,j):0≤i≤d−1,0≤j≤m−1} and arc set {(i,j)(i+1,j) or (i,j)(i+1,j+1):0≤i≤d−2,0≤j≤m−1}∪{(d−1,j)(0,j+ℓ) or (d−1,j)(0,j+ℓ+1):0≤j≤m−1}, where the second coordinate y of a vertex (x,y) is taken modulo m. We give an upper bound for the Hamiltonian number of a Möbius double loop network. We also give a necessary and sufficient condition for a Möbius double loop network MDL(d,m,ℓ) to have Hamiltonian number at most dm, dm+d, dm+1 or dm+2.
Similar content being viewed by others
References
Asano T, Nishizeki T, Watanabe T (1980) An upper bound on the length of a Hamiltonian walk of a maxima planar graph. J Graph Theory 4:315–336
Asano T, Nishizeki T, Watanabe T (1983) An approximation algorithm for the Hamiltonian walk problems on maximal planar graphs. Discrete Appl Math 5:211–222
Bermond JC (1976) On Hamiltonian walks. Congr Numer 15:41–51
Bondy JA, Murty USR (1976) Graph theory with applications. North-Holland, Amsterdam
Chartrand G, Saenpholphat V, Thomas T, Zhang P (2003) On the Hamiltonian number of a graph. Congr Numer 165:56–64
Chartrand G, Saenpholphat V, Thomas T, Zhang P (2004) A new look at Hamiltonian walks. Bull ICA 42:37–52
Goodman SE, Hedetniemi ST (1973) On Hamiltonian walks in graphs. In: Proc fourth southestern conf combin graph theory and computing, utilitas math, pp 335–342
Goodman SE, Hedetniemi ST (1974) On Hamiltonian walks in graphs. SIAM J Comput 3:214–221
Hwang FK (2001) A complementary survey on double-loop networks. Theor Comput Sci 263:211–229
Kral D, Tong L-D, Zhu X (2006) Upper Hamiltonian number and the Hamiltonian spectra of graphs. Aust J Combin 35:329–340
Thaithae S, Punnim N (2008) The Hamiltonian number of cubic graphs. In: Lect Notes Comput Sci, vol 4535, pp 213–223
Thaithae S, Punnim N (2009) The Hamiltonian number of graphs with prescribed connectivity. Ars Combin 90:237–244
Vacek P (1992) Bounds of lengths of open Hamiltonian walks. Arch Math 28:11–16
West DB (1996) Introduction to graph theory. Prentice Hall, New York
Wong CK, Coppersmith D (1974) A combinatorial problem related to multimodule memory organizations. J ACM 21:392–402
Author information
Authors and Affiliations
Corresponding author
Additional information
G.J. Chang is supported in part by the National Science Council under grant NSC98-2115-M-002-013-MY3.
L.-D. Tong is supported in part by the National Science Council under grant NSC97-2628-M-110-009-MY2.
Rights and permissions
About this article
Cite this article
Chang, G.J., Chang, TP. & Tong, LD. Hamiltonian numbers of Möbius double loop networks. J Comb Optim 23, 462–470 (2012). https://doi.org/10.1007/s10878-010-9360-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9360-4