图的色数和最小特征值.PDFVIP

图的色数和最小特征值 1 1,2 1 范益政 , 余桂东 , 汪毅 1 安徽大学数学科学学院，合肥 230039 2 安庆师范学院数学与计算科学学院，安庆 246011 摘要：在所有给定色数 χ 的n 阶图中，本文给出了一个图具有极小的最小特征值的结构性 质，并在 χ ≤ n 的情形下刻画了此图。根据所获结论，用色数给出了最小特征值的下界，以 及用最小特征值给出了色数的上界。 关键词：图；色数；邻接矩阵；最小特征值 中图分类号：O157.5 The chromatic number and the least eigenvalue of a graph 1 1,2 1 FAN Yi-Zheng , YU Gui-Dong , WANG Yi 1 School of Mathematical Sciences, Anhui University, Hefei 230039 2 School of Mathematics Computation Sciences, Anqing Normal College, Anqing 246011 Abstract: In this paper we get the structural property for a graph having the minimal least eigenvalue among all graphs of order n and given chromatic number χ, and characterize such graph under the condition χ ≤ n. By the result we obtain a lower bound of the least eigenvalue in terms of chromatic number, and an upper bound of the chromatic number in terms of the least eigenvalue of a graph. Key words: Graph; chromatic number; adjacency matrix; least eigenvalue 0 Introduction Let G V, E be a simple graph of order n with vertex set V V G {v , v , . . . , v } and edge set E E G. The adjacency matrix of G is defined to be a , matrix AG a of order n, where a if v is adjacent to v , and a otherwise. The eigenvalues of AG 基金项目： National Natural Science Foundation of China , Program for New Century Excellent Talents in University, Key Project of Chinese Ministry of Educati