On the length of longest chordless cycles

被引:0
|
作者
Van Nuffelen C. [1 ]
Van Rompay K. [1 ]
机构
[1] University of Antwerp, 2000 Antwerp
关键词
Adjacency matrix; Cycle; Eigenvalues; Rank;
D O I
10.1007/s10288-005-0062-1
中图分类号
学科分类号
摘要
Upper bounds for the length of a longest (circuit) cycle without chords in a (directed) graph are given in terms of the rank of the adjacency matrix and in terms of its eigenvalues. © Springer-Verlag 2005.
引用
收藏
页码:133 / 138
页数:5
相关论文
共 50 条
  • [21] RELATIVE LENGTH OF LONGEST PATHS AND CYCLES IN 2-CONNECTED GRAPHS
    Fan, Genghua
    Ji, Naidan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2009, 23 (03) : 1238 - 1248
  • [22] Intersecting longest paths and longest cycles: A survey
    Shabbir, Ayesha
    Zamfirescu, Carol T.
    Zamfirescu, Tudor I.
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2013, 1 (01) : 56 - 76
  • [23] BRIDGES OF LONGEST CYCLES
    ZHANG, CQ
    DISCRETE MATHEMATICS, 1989, 78 (1-2) : 195 - 211
  • [24] LONGEST CYCLES AND THEIR CHORDS
    ZHANG, CQ
    JOURNAL OF GRAPH THEORY, 1987, 11 (04) : 521 - 529
  • [25] Chords in longest cycles
    Thomassen, Carsten
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2018, 129 : 148 - 157
  • [26] Erdos-Posa property of chordless cycles and its applications
    Kim, Eun Jung
    Kwon, O-joung
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2020, 145 : 65 - 112
  • [27] On the Number of Longest and Almost Longest Cycles in Cubic Graphs
    Chia, Gek L.
    Thomassen, Carsten
    ARS COMBINATORIA, 2012, 104 : 307 - 320
  • [28] Erdos-Posa property of chordless cycles and its applications
    Kim, Eun Jung
    Kwon, O-joung
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 1665 - 1684
  • [29] Dirac-type characterizations of graphs without long chordless cycles
    Chvátal, V
    Rusu, I
    Sritharan, R
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 445 - 448
  • [30] On longest cycles in grid graphs
    Menke, B
    STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2000, 36 (1-2) : 201 - 230