图的色数和最小特征值
he chromatic number and the least eigenvalue of a graph
在所有给定色数x的n阶图中，本文给出了一个图具有极小的最小特征值的结构性质，并在x≤n/2的情形下刻画了此图。根据所获结论，用色数给出了最小特征值的下界，以及用最小特征值给出了色数的上界。
In this paper we get the structural property for a graph havingthe minimal least eigenvalue among all graphs of order n and given chromatic number x, and characterize such graph under the condition x≤n/2.By the result we obtain a lower bound of the least eigenvalue in terms of chromatic number, and an upper boundof the chromatic number in terms of the least eigenvalue of a graph.
汪毅、范益政、余桂东
数学
图色数邻接矩阵最小特征值
Graphchromatic numberadjacency matrixleast eigenvalue
汪毅,范益政,余桂东.图的色数和最小特征值[EB/OL].(2011-06-10)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201106-197.点此复制
评论