Abstract
Let G be a simple graph with n vertices, m edges. If each edge of G belongs to t triangles (t≥1), then we present a new upper bound for the Laplacian spectral radius of G which improves some known upper bounds.
Original language | English |
---|---|
Pages (from-to) | 1657-1661 |
Number of pages | 5 |
Journal | Linear Algebra and Its Applications |
Volume | 439 |
Issue number | 6 |
DOIs | |
Publication status | Published - 15 Sept 2013 |
Scopus Subject Areas
- Algebra and Number Theory
- Numerical Analysis
- Geometry and Topology
- Discrete Mathematics and Combinatorics
User-Defined Keywords
- Eigenvector
- Graph
- Laplacian spectral radius
- Upper bound