The spectral radius of triangle-free graphs

Australasian Journal of Combinatorics

Volumn 26, Issue , 2002, Pages 33-39

  Zhang, Xiao Dong ^a   Luo, Rong ^b  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b WEST VIRGINIA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0142108257     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. A. Berman and R.S. Plemmons, Nonnegative Matrices in the Mathematical Sciences, Academic 1979, reprint: Classics in Applied Mathematics 9, SIAM 1994.
2. J.A. Bondy and U.S.R. Murty, Graph theory with applications, American Elsevier Publishing Co., New York, 1976.
3. P. Erdös, R. Faudree, J. Pach and J. Spencer, How to make a graph bipartite, J. Combinatorial Theory (B) 45 (1988), 86-98.
4. M. Fieder, Algebraic connectivity of graph, Czechoslovak Math. J. 23 (1973), 298-305.
5. R. Grone and R. Merris, The Laplacian spectrum of a graph (II), SIAM J. Discrete Math. 7 (1994), 221-229.
6. A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8 (1988), 261-277.
7. J.S. Li and X.D. Zhang, A new upper bound for eigenvalues of the Laplacian matrix of a graph, Linear Algebra and its Applications 265 (1997), 93-100.
8. R. Merris, Laplacian matrices of graphs: a survey, Linear Algebra and its Applications 197/198 (1994), 143-176.
9. R. Merris, A note on the Laplacian eigenvalues, Linear Algebra and its Applications 285 (1998), 33-35.
10. J.B. Shearer, A note on bipartite subgraph of triangle-free graphs, Random Structures Algorithms 3 (1992), 223-226.