| 直径为3的图的最小特征值 |
| |
| 引用本文： | 高润霞.直径为3的图的最小特征值[J].安庆师范学院学报(自然科学版),2012,18(4):22-25. |
| |
| 作者姓名： | 高润霞 |
| |
| 作者单位： | 安庆职业技术学院,安徽安庆,246003 |
| |
| 摘 要： | 设Y是一个图集合,若对于Y中的所有图中,图G的最小特征值可以达到最小,则称G是集合Y中最小特征值的极小图。本文刻画了直径为3的n阶连通图最小特征值及其极小图。
|
| 关 键 词： | 图 直径 最小特征值 极小图 |
The Least Eigenvalue of a Graph with Diameter 3 |
| |
| GAO Run-xia.The Least Eigenvalue of a Graph with Diameter 3[J].Journal of Anqing Teachers College(Natural Science Edition),2012,18(4):22-25. |
| |
| Authors: | GAO Run-xia |
| |
| Institution: | GAO Run-xia(Anqing Vocational and Technical College,Anqing,Anhui 246003,China) |
| |
| Abstract: | Let Y be a certain set of graphs.A graph G is called a minimizing graph in the set Y if its least eigenvalue attains the minimum among all graph in Y.In this paper,we characterize the minimizing graph among all graphs of order n with diameter 3. |
| |
| Keywords: | graph diameter the least eigenvlue minimizing graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
