Hamiltonicity in directed Toeplitz graphs Tn1, 2;t1, t2

Please use this identifier to cite or link to this item: http://digitalrepository.fccollege.edu.pk/handle/123456789/1505

Full metadata record

DC Field	Value	Language
dc.contributor.author	Malik, Shabnam	-
dc.date.accessioned	2022-04-21T06:34:10Z	-
dc.date.available	2022-04-21T06:34:10Z	-
dc.date.issued	2020	-
dc.identifier.issn	2202-3518	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1505	-
dc.description.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⟩.	en_US
dc.language.iso	en_US	en_US
dc.publisher	AUSTRALASIAN JOURNAL OF COMBINATORICS	en_US
dc.subject	Adjacency matrix; Toeplitz graph; Hamiltonian graph, length of an edge	en_US
dc.title	Hamiltonicity in directed Toeplitz graphs Tn1, 2;t1, t2	en_US
Appears in Collections:	Mathematics Department

Files in This Item:

File	Description	Size	Format
1-Bull. Math. Soc. Sci. Math. Roumanie (to appear in 2023).pdf		224.96 kB	Adobe PDF	View/Open

DSpace JSPUI