支配数为2的图的最小特征值

摘要

主要考虑简单图,其特征值定义为它的邻接矩阵的特征值.在所有给定阶数且支配数为2的连通图中,完全刻画了最小特征值达到极小的图.%The paper discusses a simple graph whose eigenvalues are defined as its adjacency matrix.Among all connected graphs with fixed order and domination number 2,the graph whose least eigenvalue is minimum is presented among all those graphs.