Hamiltonian Cycles in Directed Toeplitz Graphs

被引：0
|
作者：
Malik, Shabnam [1 ]
Qureshi, Ahmad Mahmood [1 ]
机构：
[1] GC Univ Lahore, Abdus Salam Sch Math Sci, Lahore, Pakistan
来源：
ARS COMBINATORIA | 2013年 / 109卷
关键词：
Toeplitz graph; Hamiltonian graph;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
An (n x 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 discuss conditions for the existence of hamiltonian cycles in directed Toeplitz graphs.
引用
收藏
页码：511 / 526
页数：16
相关论文
共 50 条
  • [1] Hamiltonian Cycles in Directed Toeplitz Graphs-Part 2
    Malik, Shabnam
    ARS COMBINATORIA, 2014, 116 : 303 - 319
  • [2] Hamiltonian Connectedness in Directed Toeplitz Graphs
    Malik, Shabnam
    Zamfirescu, Tudor
    BULLETIN MATHEMATIQUE DE LA SOCIETE DES SCIENCES MATHEMATIQUES DE ROUMANIE, 2010, 53 (02): : 145 - 156
  • [3] On hamiltonian Toeplitz graphs
    Heuberger, C
    DISCRETE MATHEMATICS, 2002, 245 (1-3) : 107 - 125
  • [4] Hamiltonian Cycles in Directed Toeplitz Graphs Tn ⟨1, 2; t1 ≤ 5, t2⟩
    Malik, Shabnam
    UTILITAS MATHEMATICA, 2016, 99 : 3 - 17
  • [5] Hamiltonian Connectedness of Toeplitz Graphs
    Nadeem, Muhammad Faisal
    Shabbir, Ayesha
    Zamfirescu, Tudor
    MATHEMATICS IN THE 21ST CENTURY, 2015, 98 : 135 - 149
  • [6] Hamiltonian properties of Toeplitz graphs
    vanDal, R
    Tijssen, G
    Tuza, Z
    vanderVeen, JAA
    Zamfirescu, C
    Zamfirescu, T
    DISCRETE MATHEMATICS, 1996, 159 (1-3) : 69 - 81
  • [7] HAMILTONIAN CYCLES IN GRAPHS
    LIU, ZH
    ZHU, YJ
    TIAN, F
    ANNALS OF THE NEW YORK ACADEMY OF SCIENCES, 1989, 576 : 367 - 376
  • [8] The Property of Hamiltonian Connectedness in Toeplitz Graphs
    Shabbir, Ayesha
    Nadeem, Muhammad Faisal
    Zamfirescu, Tudor
    COMPLEXITY, 2020, 2020
  • [9] DIRECTED HAMILTONIAN GRAPHS
    MANOUSSAKIS, Y
    JOURNAL OF GRAPH THEORY, 1992, 16 (01) : 51 - 59
  • [10] AN EFFICIENT NC ALGORITHM FOR FINDING HAMILTONIAN CYCLES IN DENSE DIRECTED-GRAPHS
    FURER, M
    RAGHAVACHARI, B
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 510 : 429 - 440
12345