Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Cai et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: