Jin Cai, Leyou Xu, Bo Zhou
Published 2024-05-06Version 1
A chorded cycle is a cycle with at least one chord, and a doubly chorded cycle is a cycle with at least two chords. Gould asked in [Graphs Comb. 38 (2022) 189] the question: What spectral conditions imply a graph contains a chorded cycle? For a graph with fixed size, extremal spectral conditions are given to ensure that a graph contains a chorded cycle and a doubly chorded cycle, respectively, via spectral radius.
Spectral conditions implying the existence of doubly chorded cycles without or with constraints
Detecting a long even hole
Maximizing the number of independent sets of fixed size in $K_n$-covered graphs
![QR code for arXiv:2405.03229 [math.CO]](http://oss.arxitics.com/images/favicon.svg)