Shabnam Malik: Hamiltonicity in directed Toeplitz graphs $T_n\langle 1, 3, 4; t\rangle$, 317-327

Abstract:

An $(n\times n)$ matrix $A=(a_{ij})$ is called a Toeplitz matrix if it has constant values along all diagonals parallel to the main diagonal. A directed Toeplitz graph is a digraph with Toeplitz adjacency matrix. In this paper, we obtain new results and improve existing results on hamiltonicity of directed Toeplitz graph $T_n\langle 1, 3, 4; t\rangle$.

Key Words: Adjacency matrix, Toeplitz matrix, Toeplitz graph, Hamiltonian graph, increasing and decreasing edge, length of an edge.

2010 Mathematics Subject Classification: Primary 05C20; Secondary 05C45.

Download the paper in pdf format here.