Spectral conditions for the existence of chorded cycles in graphs with fixed size

2024/05/06 by Jin Cai, Cai, Jin, Leyou Xu +3
Engineering · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Spectral Theory in Mathematical Physics #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2405.03229

openalex publication_date 2024/05/06 · openalex created_date 2024/05/10 · openalex updated_date 2026/07/28

Abstract

A chorded cycle is a cycle with at least one chord. 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 (2k-3)-chorded (2k+1)-cycle for k≥ 2, respectively, via spectral radius.

Related

• Answers to Gould's question concerning the existence of chorded cycles
• Spectral conditions implying the existence of doubly chorded cycles without or with constraints
• Spectral condition for the existence of a chorded cycle
• The minimum size of a chordal graph with given order and minimum degree
• Spectral radius and Hamiltonian properties of graphs, II