Please use this identifier to cite or link to this item: http://digitalrepository.fccollege.edu.pk/handle/123456789/1505
Title: Hamiltonicity in directed Toeplitz graphs Tn1, 2;t1, t2
Authors: Malik, Shabnam
Keywords: Adjacency matrix; Toeplitz graph; Hamiltonian graph, length of an edge
Issue Date: 2020
Publisher: AUSTRALASIAN JOURNAL OF COMBINATORICS
Abstract: A square matrix of order n is called a Toeplitz matrix if it has constant val- ues along all diagonals parallel to the main diagonal. A directed Toeplitz graph Tn⟨s1; : : : ; sk; t1; : : : ; tl⟩ with vertices 1; 2; : : : ; n, where the edge (i; j) occurs if and only if j − i = sp or i − j = tq for some 1 ≤ p ≤ k and 1 ≤ q ≤ l, is a digraph whose adjacency matrix is a Toeplitz matrix. In this paper, we study hamiltonicity in directed Toeplitz graphs Tn⟨1; 3; 1; t⟩. We obtain new results and improve existing results on Tn⟨1; 3; 1; t⟩.
URI: http://localhost:8080/xmlui/handle/123456789/1505
ISSN: 2202-3518
Appears in Collections:Mathematics Department

Files in This Item:
File Description SizeFormat 
1-Bull. Math. Soc. Sci. Math. Roumanie (to appear in 2023).pdf224.96 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.