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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	Kamal Lochan Patra, Binod Kumar Sahoo
Médium:	Artigo
Jazyk:	Inglês
Vydáno:	Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2017-10-01
Edice:	Electronic Journal of Graph Theory and Applications
Témata:	graph, laplacian matrix, laplacian spectral radius, upper bound, lower bound
On-line přístup:	http://www.ejgta.org/index.php/ejgta/article/view/209
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!