Abstract
In this paper, we study the relationship between spectral radius and maximum average degree of graphs. By using this relationship and the previous technique of Li and Ning in (J Graph Theory 103:486–492, 2023), we prove that, for any given positive number \(\varepsilon <\frac{1}{3}\), if n is a sufficiently large integer, then any graph G of order n with \(\rho (G)>\sqrt{\left\lfloor \frac{n^{2}}{4}\right\rfloor }\) contains a cycle of length t for all integers \(t\in [3,(\frac{1}{3}-\varepsilon )n]\), where \(\rho (G)\) is the spectral radius of G. This improves the result of Li and Ning (2023).
Similar content being viewed by others
Data Availability
There is no associated data.
References
Brouwer, A.E., Haemers, W.H.: Spectra of Graphs. Springer (2012)
Brualdi, R.A., Solheid, E.S.: On the spectral radius of connected graphs. Publ. Inst. Math. 39, 45–54 (1986)
Bell, F.K.: On the maximal index of connected graphs. Linear Algebra Appl. 144, 135–151 (1991)
Cvetković, D., Rowlinson, P.: On connected graphs with maximal index. Publ. Inst. Math. 44, 29–34 (1988)
Cvetković, D., Rowlinson, P., Simić, S.: An Introduction to the Theory of Graph Spectra. Cambridge University Press, Cambridge (2010)
Fan, G., Li, Y., Song, N., Yang, D.: Decomposing a graph into pseudoforests with one having bounded degree, Theory. J. Comb. Ser. B 115, 72–95 (2015)
Grout, L., Moore, B.: The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true. J. Comb. Theory Ser. B 145, 433–449 (2020)
Gould, R.J., Haxell, P.E., Scott, A.D.: A note on cycle lengths in graphs. Graphs Combin. 18, 491–498 (2002)
Hong, Y., Shu, J.L., Fang, K.F.: A sharp upper bound of the spectral radius of graphs, Theory. J. Comb. Ser. B 81, 177–183 (2001)
Hakimi, S.L.: On the degrees of the vertices of a directed graph. J. Frankl. Inst. 279(4), 290–308 (1965)
Li, B., Ning, B.: Eigenvalues and cycles of consecutive lengths. J. Graph Theory. 103, 486–492 (2023)
Nikiforov, V.: A spectral condition for odd cycles in graphs. Linear Algebra Appl. 428, 1492–1498 (2008)
Nikiforov, V.: Bounds on graph eigenvalues II. Linear Algebra Appl. 427, 183–189 (2007)
Ning, B., Peng, X.: Extensions of the Erdős-Gallai theorem and Luo’s theorem. Combin. Probab. Comput. 29, 128–136 (2020)
Rowlinson, P.: On the maximal index of graphs with a prescribed number of edges. Linear Algebra Appl. 110, 43–53 (1988)
Sun, S.W., Das, K.: A conjecture on the spectral radius of graphs. Linear Algebra Appl. 588, 74–80 (2020)
Voss, H., Zuluaga, C.: Maximale gerade und ungerade Kreise in Graphen I (German). Wiss. Z. Tech. Hochsch. Ilmenau. 23, 57–70 (1977)
Zhai, M., Lin, H.: A strengthening of the spectral chromatic critical edge theorem: books and theta graphs. J. Graph Theory. 102, 502–520 (2023)
Zhang, Z., Zhao, Y.: A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs. Discrete Math. 346, 113365 (2023)
Zhai, M., Lin, H.: Spectral extrema of \(K_{s,t}\)-minor free graphs—on a conjecture of M. Tait, J. Comb. Theory Ser. B 157, 184–215 (2022)
Acknowledgements
The author would like to thank the editors and the referees for their valuable comments.
Funding
This work is supported by NSFC (No. 12301448) and NSF of Shandong Province (No. ZR2022QA045).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
There is no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Zhang, W. The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs. Graphs and Combinatorics 40, 32 (2024). https://doi.org/10.1007/s00373-024-02761-0
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02761-0