中文

关于$K_{r+1}$-饱和图谱半径的注记

组合数学 2022-02-11 v2

摘要

ρ(G)\rho\left( G\right) 为图GG的谱半径,Sn,rS_{n,r}为联结KrKnrK_{r}\vee\overline{K}_{n-r}。设n>r2n>r\geq2,且GG为阶为nnKr+1K_{r+1}-饱和图。近来Kim、Kim、Kostochka和O精确确定了r=2r=2ρ(G)\rho\left( G\right) 的最小值,并找到了r3r\geq3ρ(G)\rho\left( G\right) 的渐近紧界。他们还猜想ρ(G)>ρ(Sn,r1), \rho\left( G\right) >\rho\left( S_{n,r-1}\right) , 除非G=Sn,r1G=S_{n,r-1}。本注记证明了他们的猜想。

关键词

引用

@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}
}

备注

Proposition 6 is wrong. There are counterexamples to the statement