不含相交奇圈的图的谱半径
组合数学
2022-04-04 v2
摘要
设 为具有 个三角形和 个长度分别为 的奇圈且恰好交于一个公共顶点的图。近来，Hou、Qiu 和 Liu [Discrete Math. 341 (2018) 126--137] 与 Yuan [J. Graph Theory 89 (1) (2018) 26--39] 各自独立地确定了不含 作为子图的 顶点图的最大边数。本文中，对于足够大的 ，我们确定了在所有不含 的图中达到最大谱半径的 阶图。
引用
@article{arxiv.2106.00587,
title = {The spectral radius of graphs with no intersecting odd cycles},
author = {Yongtao Li and Yuejian Peng},
journal= {arXiv preprint arXiv:2106.00587},
year = {2022}
}
备注
25 pages. This is the Journal Version. The problem raised at the end of our paper was recently solved by Chen, Liu and Zhang; see arXiv:2108.03895. The extremal spectral problem involving the intersecting cliques was also solved in another paper; see the joint work arXiv:2108.03587v2. arXiv admin note: text overlap with arXiv:1911.13082 by other authors