On traceable powers of digraphs

被引：0
|
作者：
Marczyk, A [1 ]
Schaar, G [1 ]
机构：
[1] Tech Univ Bergakad Freiberg, Fak Math & Informat, D-09596 Freiberg, Germany
来源：
DISCRETE MATHEMATICS | 2000年 / 212卷 / 1-2期
关键词：
digraph; strongly connectedness; Hamiltonian path; Hamiltonian cycle; traceability; distance; power;
D O I：
10.1016/S0012-365X(99)00213-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let D be a strongly connected digraph of order it. The kth power D-k of D is the digraph with the same set of vertices, a vertex x being joined to a vertex y not equal x in D-k if the directed distance from x to y in D is less than or equal to k. We show that for k greater than or equal to right perpendicular n/2 left perpendicular to, D-k is traceable and we characterize the digraphs D of even order n whose (n/2 - 1)th power is traceable. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：121 / 128
页数：8
相关论文
共 50 条
  • [31] Traceable signatures
    Kiayias, A
    Tsiounis, Y
    Yung, M
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2004, PROCEEDINGS, 2004, 3027 : 571 - 589
  • [32] Traceable Regressions
    Wermuth, Nanny
    [J]. INTERNATIONAL STATISTICAL REVIEW, 2012, 80 (03) : 415 - 438
  • [33] CKI-Digraphs, Generalized Sums and Partitions of Digraphs
    Hortensia Galeana-Sánchez
    Mika Olsen
    [J]. Graphs and Combinatorics, 2016, 32 : 123 - 131
  • [34] ON SUPER-EDGE-CONNECTED DIGRAPHS AND BIPARTITE DIGRAPHS
    FIOL, MA
    [J]. JOURNAL OF GRAPH THEORY, 1992, 16 (06) : 545 - 555
  • [35] Extensions and kernels in digraphs and in edge-coloured digraphs
    Instituto de Matemáticas, Universidad Nacional Autónoma de México, México, D.F. 04510, Mexico
    不详
    [J]. WSEAS Trans. Math., 2007, 2 (334-341):
  • [36] INFINITE DIGRAPHS ISOMORPHIC WITH THEIR LINE DIGRAPHS - PRELIMINARY REPORT
    HEMMINGE.RL
    BEINEKE, LW
    [J]. NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 21 (01): : A30 - A30
  • [37] ON THE EXISTENCE OF K-KERNELS IN DIGRAPHS AND IN WEIGHTED DIGRAPHS
    Galeana-Sanchez, Hortensia
    Hernandez-Cruz, Cesar
    [J]. AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2010, 7 (02) : 201 - 215
  • [38] Infinite circulant digraphs and random infinite circulant digraphs
    Huang, QX
    Meng, JX
    Zhang, FJ
    [J]. ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2002, 18 (04) : 817 - 822
  • [39] CKI-Digraphs, Generalized Sums and Partitions of Digraphs
    Galeana-Sanchez, Hortensia
    Olsen, Mika
    [J]. GRAPHS AND COMBINATORICS, 2016, 32 (01) : 123 - 131
  • [40] Infinite Circulant Digraphs and Random Infinite Circulant Digraphs
    Qiang Xiang HUANG
    Ji Xiang MENG The College of Mathematics and Sciences. Xinjiang University. Urumqi 830046. P. R. China Fu Ji ZHANG The Department of Mathematics. Xiamen University. Xiamen 301005. P. R. China
    [J]. Acta Mathematica Sinica,English Series, 2002, 18 (04) : 817 - 822
12345