Showing 1 - 10 of 4,354
Let k be a natural number and let G be a graph with at least k vertices. A.E. Brouwer conjectured that the sum of the k largest Laplacian eigenvalues of G is at most e(G) (k choose 2), where e(G) is the number of edges of G. We prove this conjecture for k = 2. We also show that if G is a tree,...
Persistent link: https://www.econbiz.de/10012722415
We study graphs with spectral radius at most $\frac{3}{2}\sqrt{2}$ and refine results by Woo and Neumaier [On graphs whose spectral radius is bounded by $\frac{3}{2}\sqrt{2}$, Graphs Combinatorics 23 (2007), 713-726]. We study the limit points of the spectral radii of certain families of graphs,...
Persistent link: https://www.econbiz.de/10012723278
Persistent link: https://www.econbiz.de/10014380754
Persistent link: https://www.econbiz.de/10015144290
Persistent link: https://www.econbiz.de/10013325467
Persistent link: https://www.econbiz.de/10013325470
Persistent link: https://www.econbiz.de/10010258566
Persistent link: https://www.econbiz.de/10010190838
Persistent link: https://www.econbiz.de/10010250332
Persistent link: https://www.econbiz.de/10010410005