Back to Search
Start Over
Spectral extremal graphs for edge blow-up of star forests.
- Source :
-
Discrete Mathematics . Oct2024, Vol. 347 Issue 10, pN.PAG-N.PAG. 1p. - Publication Year :
- 2024
-
Abstract
- The edge blow-up of a graph G , denoted by G p + 1 , is obtained by replacing each edge of G with a clique of order p + 1 , where the new vertices of the cliques are all distinct. Yuan (2022) [20] determined the range of the Turán numbers for edge blow-up of all bipartite graphs and the exact Turán numbers for edge blow-up of all non-bipartite graphs. In this paper, we prove that the graphs with the maximum spectral radius in an n -vertex graph without any copy of edge blow-up of star forests are the extremal graphs for edge blow-up of star forests when n is sufficiently large. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 347
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 178291546
- Full Text :
- https://doi.org/10.1016/j.disc.2024.114141