Opening book details…
Can I read Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs on EtoBox?
Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs by Kinkar Ch. Das is a Mathematics article available to read on EtoBox.
What is Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs about?
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.
Who reads Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs?
It is typically read by researchers, students, and practitioners in Mathematics.
- Author
- Kinkar Ch. Das
- Publisher
- Elsevier Science; Elsevier ; Elsevier BV (ISSN 0024-3795)
- Published
- 2007
- Language
- EN
- Field
- Mathematics (Physical Sciences)