QR Code

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

Whakaahuatanga katoa

I tiakina i:
Ngā taipitopito rārangi puna kōrero
Ngā kaituhi matua: Kamal Lochan Patra, Binod Kumar Sahoo
Hōputu: Artigo
Reo:Inglês
I whakaputaina: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2017-10-01
Rangatū:Electronic Journal of Graph Theory and Applications
Ngā marau:
Urunga tuihono:http://www.ejgta.org/index.php/ejgta/article/view/209
Ngā Tūtohu: Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!