Hamiltonian properties of Toeplitz graphs (Q1126180): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Gert A. Tijssen / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Christina Maria Zamfirescu / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Tudor I. Zamfirescu / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Ralph J. Faudree / rank | |||
Normal rank |
Revision as of 06:05, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Hamiltonian properties of Toeplitz graphs |
scientific article |
Statements
Hamiltonian properties of Toeplitz graphs (English)
0 references
9 June 1997
0 references
A Toeplitz graph is an undirected graph that has an adjacency matrix in which all of the entries are the same in any diagonal parallel to the main diagonal. The Toeplitz graph \(T_n(t_1,t_2,\dots,t_k)\) has adjacency matrix with \(k\) nonzero diagonals that contain the \(k\) rows \(0<t_1<t_2<\cdots<t_k\leq n\). Hamiltonian properties (Hamiltonicity, traceability) of these graphs are investigated. For example it is shown that the Toeplitz graph \(T_n(1,t_2,\dots,t_k)\) is Hamiltonian if and only if either \(n,t_2,\dots,t_k\) are not all of the same parity or they all are even and \(t_2\leq n/2\).
0 references
Hamiltonicity
0 references
Toeplitz graph
0 references
adjacency matrix
0 references
traceability
0 references
Hamiltonian
0 references