中文

禁含奇圈的图的极大 Q 指数

组合数学 2014-09-11 v3

摘要

q(G)q\left( G\right) GGQQ 指数(无符号拉普拉斯矩阵的最大特征值)。设 Sn,kS_{n,k} 为将 kk 阶完全图的每个顶点与 nkn-k 阶独立集的每个顶点相连得到的图。本文的主要结果是以下定理:设 k3,k\geq3, n110k2,n\geq110k^{2},GGnn 阶图。若 GG 不含 C2k+1,C_{2k+1},q(G)<q(Sn,k),q\left( G\right) <q\left( S_{n,k}\right) , 除非 G=Sn,k.G=S_{n,k}. 该结果证明了文献 [M.A.A. de Freitas, V. Nikiforov, and L. Patuzzi, Maxima of the QQ-index: forbidden 44-cycle and 55-cycle, \emph{Electron. J. Linear Algebra }26 (2013), 905-916.] 中猜想的奇数情形。

关键词

引用

@article{arxiv.1401.4363,
  title  = {Maxima Q-index of graphs with forbidden odd cycles},
  author = {Xiying Yuan},
  journal= {arXiv preprint arXiv:1401.4363},
  year   = {2014}
}

备注

The new version contains a new proof of Lemma 10, as the previous one had a gap, which was pointed out by Dr. Bo Ning