A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs

DOI10.1016/J.DISC.2023.113365arXiv2110.11345MaRDI QIDQ6380978FDOQ6380978

Authors: Zhiyuan Zhang, Yanhua Zhao 

Publication date: 20 October 2021

Abstract: A graph $G$ is called $H$-free, if it does not contain $H$ as a subgraph. In 2010, Nikiforov proposed a Brualdi-Solheid-Tur'{a}n type problem: what is the maximum spectral radius of an $H$-free graph of order $n$? In this paper, we consider the Brualdi-Solheid-Tur'{a}n type problem for non-bipartite graphs. Let $$ denote the graph obtained by identifying a vertex of $K_{a,b}$ in the part of size $b$ and a vertex of $K_3$. We prove that if $G$ is a non-bipartite graph of order $n$ satisfying $$, then $G$ contains all odd cycles $C_{2l+1}$ for each integer $lin[2,k]$ unless $$, provided that $n$ is sufficiently large with respect to $k$. This resolves the problem posed by Guo, Lin and Zhao (2021).

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Paths and cycles (05C38)

This page was built for publication: A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6380978)