Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.03229 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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\ge 2$, respectively, via spectral radius.