Bounds for the Laplacian spectral radius of graphs
This paper is a survey on the upper and lower bounds for the largest eigenvalue of the Laplacian matrix, known as the Laplacian spectral radius, of a graph. The bounds are given as functions of graph parameters like the number of vertices, the number of edges, degree sequence, average 2-degrees, dia...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
| Serie: | Electronic Journal of Graph Theory and Applications |
| Soggetti: | |
| Accesso online: | http://www.ejgta.org/index.php/ejgta/article/view/209 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|