| 支配数为2的图的最小特征值 |
| |
| 引用本文： | 李小新,钱克仕.支配数为2的图的最小特征值[J].池州师专学报,2011(3):4-6. |
| |
| 作者姓名： | 李小新 钱克仕 |
| |
| 作者单位： | 池州学院数学与计算机科学系,安徽池州247000 |
| |
| 基金项目： | 安徽省高等学校自然科学研究项目（KJ2010B136）; 池州学院引进研究性项目（2009RC011） |
| |
| 摘 要： | 主要考虑简单图,其特征值定义为它的邻接矩阵的特征值.在所有给定阶数且支配数为2的连通图中,完全刻画了最小特征值达到极小的图.
|
| 关 键 词： | 图 邻接矩阵 最小特征值 支配数 |
The Least Eigenvalue of a Graph with Domination Number Two |
| |
| Li Xiaoxin,Qian Keshi.The Least Eigenvalue of a Graph with Domination Number Two[J].Journal of Chizhou Teachers College,2011(3):4-6. |
| |
| Authors: | Li Xiaoxin Qian Keshi |
| |
| Institution: | (Department of Mathematics and Computer Science,Chizhou College,Anhui 247000) |
| |
| Abstract: | 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. |
| |
| Keywords: | Graph Adjacency Matrix Least Eigenvalue Domination Number |
| 本文献已被 维普 等数据库收录！ |
