English

Remarks on the spectral radius of $K_{r+1}$-saturated graphs

Combinatorics 2022-02-11 v2

Abstract

Write ρ(G)\rho\left( G\right) for the spectral radius of a graph GG and Sn,rS_{n,r} for the join KrKnr.K_{r}\vee\overline{K}_{n-r}. Let n>r2n>r\geq2 and GG be a Kr+1K_{r+1}-saturated graph of order n.n. Recently Kim, Kim, Kostochka, and O determined exactly the minimum value of ρ(G)\rho\left( G\right) for r=2r=2, and found an asymptotically tight bound on ρ(G)\rho\left( G\right) for r3.r\geq3. They also conjectured that ρ(G)>ρ(Sn,r1), \rho\left( G\right) >\rho\left( S_{n,r-1}\right) , unless G=Sn,r1.G=S_{n,r-1}. In this note their conjecture is proved.

Keywords

Cite

@article{arxiv.2105.02297,
  title  = {Remarks on the spectral radius of $K_{r+1}$-saturated graphs},
  author = {V. Nikiforov},
  journal= {arXiv preprint arXiv:2105.02297},
  year   = {2022}
}

Comments

Proposition 6 is wrong. There are counterexamples to the statement