第二大特征值不大于1的复合图
On composition graph Whose Second Largest Eigen values Does Not Exceed 1
摘要
文章讨论第二大特征值不大于1的一种复合图。
This paper discusses some composition graph Whose Second Largest Eigen values Does Not Exceed 1.
出处
《新疆师范大学学报（自然科学版）》
2011年第4期75-76,共2页
Journal of Xinjiang Normal University(Natural Sciences Edition)
关键词
第二大特征值
复合图
讨论
The Second Largest Eigen values
Composition graph
D
参考文献7
-
1D. Cvetkovic, M. Doob. H. Sachs. Spectra Of Graphs. Academia Press. New York,1980:1--3.
-
2Y. H ong, Sharp Low Bounds On The Eigenvalues Of Tree. Linear Algebra And Its Application. 1980, (113) ~101-105.
-
3J. L. Shu. On Tree Whose Second Largest Eigenvalues Does Not Exceed 1, OR Trees. 1998,2 (3) :6--9.
-
4G. H. Xu. On Uncyclic Graph Whose Second Largest Eigenvalue Does not Exceed 1, Discrete Application Mathematics, 2004,136:117-- 124.
-
5S. G. Guo. On Bicyclic Graph Whose Second Largest Eigenvalues Does Not Exceed I, Linear Algebra And Application. 2005,407 : 201-- 210.
-
6D. Cvetkovic. On Graphs Whose Second Largest Eigenvalues Does Not Exceed 1. Publ. Inst. Math(Beograd) (N. S). 1982,31(45) : 15-- 20.
-
7C. Godsil, Gordon Royle. Algebra Graph Theory, Springer Verlag, New York,2001:1--10.
