Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7
Keywords:
Adjacency matrix, Toeplitz graph, Hamiltonian graphAbstract
A directed Toeplitz graph Tn⟨a1, . . . , ap; b1, . . . , bq⟩ with vertices 1, 2, . . . , n, where the edge (i, j) occurs if and only if j − i = as or i − j = bt for some 1 ≤ s ≤ p and 1 ≤ t ≤ q, is a digraph whose adjacency matrix is a Toeplitz matrix. In this paper, we study hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7, only.
Downloads
Download data is not yet available.
Downloads
Published
2024-12-31
Issue
Section
Regular
How to Cite
Hamiltonicity in directed Toeplitz graphs having increasing edges of length 1, 3 and 7. (2024). Journal of Prime Research in Mathematics, 20(2), 64 – 76. https://jprm.sms.edu.pk/index.php/jprm/article/view/232