On Hamiltonian Toeplitz graphs

Authors:
Clemens Heuberger
Affiliations:
Institut für Mathematik B, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Discrete Mathematics
Year:
2002

Citing 3
Cited 5

Efficiently solvable special cases of bottleneck travelling salesman problems

Discrete Applied Mathematics
Hamiltonian cycles in circulant digraphs with two stripes

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

The Traveling Salesman Problem in Circulant Weighted Graphs With Two Stripes

Electronic Notes in Theoretical Computer Science (ENTCS)
The travelling salesman problem in symmetric circulant matrices with two stripes

Mathematical Structures in Computer Science
Connectedness of finite distance graphs

Networks
On the chromatic number of Toeplitz graphs

Discrete Applied Mathematics
Bipartite finite Toeplitz graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We consider hamiltonian properties of Toeplitz graphs, i.e. graphs whose adjacency matrix is constant along diagonals. Extending previous results of van Dal et al. (Discrete Math. 159 (1996) 69) we prove connectivity and Hamiltonicity for some classes of Toeplitz graphs.