It is well-known that eigenvalues of graphs can be used to describe structural properties and parameters of graphs. A theorem of Nosal and Nikiforov states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, equality holds if and only if $G$ is a complete bipartite graph. Recently, Lin, Ning and Wu [Combin. Probab. Comput. 30 (2021)] proved a generalization for non-bipartite triangle-free graphs. Moreover, Zhai and Shu [Discrete Math. 345 (2022)] presented a further improvement. In this paper, we present an alternative method for proving the improvement by Zhai and Shu. Furthermore, the method can allow us to give a refinement on the result of Zhai and Shu for non-bipartite graphs without short odd cycles.
@article{10_37236_11236,
author = {Yongtao Li and Yuejian Peng},
title = {The maximum spectral radius of non-bipartite graphs forbidding short odd cycles},
journal = {The electronic journal of combinatorics},
year = {2022},
volume = {29},
number = {4},
doi = {10.37236/11236},
zbl = {1503.05078},
url = {http://geodesic.mathdoc.fr/articles/10.37236/11236/}
}
TY - JOUR
AU - Yongtao Li
AU - Yuejian Peng
TI - The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
JO - The electronic journal of combinatorics
PY - 2022
VL - 29
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/11236/
DO - 10.37236/11236
ID - 10_37236_11236
ER -
%0 Journal Article
%A Yongtao Li
%A Yuejian Peng
%T The maximum spectral radius of non-bipartite graphs forbidding short odd cycles
%J The electronic journal of combinatorics
%D 2022
%V 29
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/11236/
%R 10.37236/11236
%F 10_37236_11236
Yongtao Li; Yuejian Peng. The maximum spectral radius of non-bipartite graphs forbidding short odd cycles. The electronic journal of combinatorics, Tome 29 (2022) no. 4. doi: 10.37236/11236
