On hamiltonian Toeplitz graphs
Let \(n,m,a_1,\dots,a_m\in \mathbb{N}\), \(0<a_1<\cdots <a_m<n\) and \(V:=\{0,\dots,n-1\}\). Define \(E:=\{[i,j]\in V^2:|j-i|=a_k\) for some \(k\in\{1,\dots,m\}\}.\) Then the graph \((V,E)\) with set of vertices \(V\) and set of edges \(E\) is called an undirected Toeplitz graph with stripes \(a_1,\dots,a_m\). The author considers connectivity properties and hamiltonian properties of Toeplitz graphs. A sufficient condition for a Toeplitz graph to be connected is described and a complete characterization of connected Toeplitz graphs with two stripes is given. An infinite family of hamiltonian and of nonhamiltonian Toeplitz graphs with two stripes are described. Sufficient conditions for Toeplitz graphs with many entries to be hamiltonian are derived as well. Note that the circulant graphs are special Toeplitz graphs.
- Hamiltonian properties of Toeplitz graphs
- Coloring planar Toeplitz graphs and the stable set polytope.
- Combinatorial PDEs on Hamming graphs
- Structural properties of Toeplitz graphs
- The property of Hamiltonian connectedness in Toeplitz graphs
- Bipartite finite Toeplitz graphs
- Coloring Toeplitz graphs
- A generalization of the concept of Toeplitz graphs
- Hamiltonian Cycles in Striped Graphs: The Two-Stripe Problem
- Hamiltonian graphs from Kirkman to König
- On super edge-antimagic total labeling of Toeplitz graphs
- Hamiltonian Connectedness of Toeplitz Graphs
- scientific article; zbMATH DE number 5787327 (Why is no real title available?)
- On planar Toeplitz graphs
- On the chromatic number of Toeplitz graphs
- Hamiltonicity in directed Toeplitz graphs T_n 1, 2; t₁, t₂
- Conditions for regularity and for 2-connectivity of Toeplitz graphs
- Connectedness of finite distance graphs
- The Travelling Salesman Problem in symmetric circulant matrices with two stripes
- Characterizing bipartite Toeplitz graphs
- A comparison of lower bounds for the symmetric circulant traveling salesman problem
- Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
- Hamiltonicity in directed Toeplitz graphs with s₁=1 and s₂=3
- Hamiltonicity in directed Toeplitz graphs T_n1, 3, 5; t
- Hamiltonicity in directed Toeplitz graphs T_n(1, 3; 1, t)
- Hamiltonicity in directed Toeplitz graphs T_n 1, 3, 6; t
- Structural properties of symmetric Toeplitz and Hankel matrices
This page was built for publication: On hamiltonian Toeplitz graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348117)
