Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs

✍ Scribed by Kinkar Ch. Das

• Publisher: Elsevier Science
• Year: 2007
• Tongue: English
• Weight: 214 KB
• Volume: 427
• Category: Article
• ISSN: 0024-3795
• DOI: 10.1016/j.laa.2007.06.018

✦ Synopsis

We consider weighted graphs, where the edge weights are positive definite matrices. In this paper, we obtain two upper bounds on the spectral radius of the Laplacian matrix of weighted graphs and characterize graphs for which the bounds are attained. Moreover, we show that some known upper bounds on the Laplacian spectral radius of weighted and unweighted graphs can be deduced from our upper bounds.