给定连通度的图之补图的最小特征值
组合数学
2025-09-03 v3
摘要
图的最小特征值是的邻接矩阵的最小特征值。本文确定了在所有具有给定连通度的连通简单图的补图中，达到最小特征值最小的图。
引用
@article{arxiv.2305.17143,
title = {The least eigenvalue of the complements of graphs with given connectivity},
author = {Huan Qiu and Keng Li and Guoping Wang},
journal= {arXiv preprint arXiv:2305.17143},
year = {2025}
}
备注
10 pages. arXiv admin note: substantial text overlap with arXiv:2209.05694