Hamiltonian Cycles in Directed Toeplitz Graphs-Part 2

被引：0
作者：
Malik, Shabnam [1 ]
机构：
[1] GC Univ Lahore, Abdus Salam Sch Math Sci, Lahore, Pakistan
来源：
ARS COMBINATORIA | 2014年 / 116卷
关键词：
Toeplitz graph; Hamiltonian graph;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A directed Toeplitz graph is a digraph with a Toeplitz adjacency matrix. In this paper we contribute to [6]. The paper [6] investigates the hamiltonicity of the directed Toeplitz graphs T-n < s(1),s(2),...,s(k);t(1),t(2),...,t(l)> with s(2) = 2 and in particular those with s(3) = 3. In this paper we extend this investigation to s(2) = 3 with s(1) = t(1) = 1.
引用
收藏
页码：303 / 319
页数：17
相关论文
共 6 条
[1]   Characterizing bipartite Toeplitz graphs [J].
Euler, R .
THEORETICAL COMPUTER SCIENCE, 2001, 263 (1-2) :47-58
[2]  
EULER R., 1995, Combinatorics and Graph Theory, V1, P119
[3]  
EULER R, 1998, Tech. Report
[4]   On hamiltonian Toeplitz graphs [J].
Heuberger, C .
DISCRETE MATHEMATICS, 2002, 245 (1-3) :107-125
[5]  
Malik S., ARS COMBINA IN PRESS
[6]   Hamiltonian properties of Toeplitz graphs [J].
vanDal, R ;
Tijssen, G ;
Tuza, Z ;
vanderVeen, JAA ;
Zamfirescu, C ;
Zamfirescu, T .
DISCRETE MATHEMATICS, 1996, 159 (1-3) :69-81
1