A new upper bound for the Laplacian spectral radius of a graph
ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 730-738.
Voir la notice de l'article dans Electronic Library of Mathematics
Summary: Let G be a simple connected graph with m edges, and the line graph of G with degree sequence t
Classification :
05C50, 15A18
Mots-clés : Laplacian spectral radius, line graph, degree sequence
Mots-clés : Laplacian spectral radius, line graph, degree sequence
@article{EEJLA_2010__20__a2, author = {Yu, Aimei}, title = {A new upper bound for the {Laplacian} spectral radius of a graph}, journal = {ELA. The Electronic Journal of Linear Algebra}, pages = {730--738}, publisher = {mathdoc}, volume = {20}, year = {2010}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a2/} }
Yu, Aimei. A new upper bound for the Laplacian spectral radius of a graph. ELA. The Electronic Journal of Linear Algebra, Tome 20 (2010), pp. 730-738. https://geodesic-test.mathdoc.fr/item/EEJLA_2010__20__a2/