论文信息 - On hamiltonian Toeplitz graphs

On hamiltonian Toeplitz graphs

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.

Clemens Heuberger

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] V. Chvátal. On Hamilton's ideals , 1972 .

[3] Rainer E. Burkard,et al. Efficiently solvable special cases of bottleneck travelling salesman problems , 1991, Discret. Appl. Math..

[4] P Erdős. (1) 15* Remarks on a Paper of Pósa , .

[5] Gerhard J. Woeginger,et al. Hamiltonian cycles in circulant digraphs with two stripes , 1997, Discret. Math..

[6] Heinz-Jürgen Voss,et al. Über Kreise in Graphen , 1974 .

[7] Zsolt Tuza,et al. Hamiltonian properties of Toeplitz graphs , 1996, Discret. Math..