Laplacian spectral radius of trees with given maximum degree
From MaRDI portal
(Redirected from Publication:947660)
Recommendations
Cites work
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- scientific article; zbMATH DE number 2010091 (Why is no real title available?)
- scientific article; zbMATH DE number 1930773 (Why is no real title available?)
- scientific article; zbMATH DE number 5030015 (Why is no real title available?)
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- Graph theory
- Improved bounds for the largest eigenvalue of trees
- Laplacian matrices of graphs: A survey
- On the Laplacian spectral radius of a tree.
- On the Laplacian spectral radius of trees with fixed diameter
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The path is the tree with smallest greatest Laplacian eigenvalue
Cited in
(16)- On the Laplacian spectral radii of trees
- On the Laplacian spectral radii of bipartite graphs
- The Laplacian spectral radius of some graphs
- The Dirichlet spectral radius of trees
- New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
- Maximizing Laplacian spectral radius over trees with fixed diameter
- Trees with given maximum degree minimizing the spectral radius
- Laplacian spectral radius and maximum degree of trees with perfect matchings
- Maximal distance spectral radius of trees
- The Laplacian spectral radius of trees and maximum vertex degree
- The spectral moments of trees with given maximum degree
- The Laplacian spectral radius of bicyclic graphs with a given girth
- The Laplacian spectral radii of trees with degree sequences
- Note on the \(k\)th Laplacian eigenvalues of trees with perfect matchings
- Distance spectral radius of trees with fixed maximum degree
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
This page was built for publication: Laplacian spectral radius of trees with given maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947660)