首页|Spectral extremal graphs for intersecting cliques
Spectral extremal graphs for intersecting cliques
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
The (k, r)-fan is the graph consisting of k copies of the complete graph Kr which intersect in a single vertex, and is denoted by Fk,r. Erdos et al. (1995) [14] determined the maximum number of edges in an n-vertex graph that does not contain F(k,3 )as a subgraph. Furthermore, Chen et al. (2003) [5] proved the analogous result on F-k,F-r for the general case r >= 3. In this paper, we show that for sufficiently large n, the graphs of order n that contain no copy of F-k,F-r and attain the maximum spectral radius are also edge-extremal. That is, such graphs must have ex(n, F-k,F-r) edges. (C)& nbsp;2022 Elsevier Inc. All rights reserved.
NSTL
Elsevier
