On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
From MaRDI portal
Publication:1735433
DOI10.1016/j.amc.2017.01.066zbMath1411.05154OpenAlexW2591179932MaRDI QIDQ1735433
Publication date: 28 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.01.066
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
- The signless Laplacian spectral radius of unicyclic and bicyclic graphs with a given girth
- Spanning trees with a bounded number of branch vertices in a claw-free graph
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The Laplacian spectral radii of trees with degree sequences
- Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
- On the spectral radius of unicyclic graphs with prescribed degree sequence
- The signless Laplacian spectral radius of graphs with given degree sequences
- Bounds on the index of the signless Laplacian of a graph
- Bounds and conjectures for the signless Laplacian index of graphs
- Graphs with given degree sequence and maximal spectral radius
- Signless Laplacian spectral radius and Hamiltonicity
- A Faber-Krahn-type inequality for regular trees
- The spectral radius of trees on \(k\) pendant vertices
- On the index of caterpillars
- On the eigenvalues of trees
- The Laplacian Spectrum of a Graph
- Eigenvalue bounds for the signless laplacian
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- Indices of trees with a prescribed diameter
- Tough spiders
This page was built for publication: On ordinary and signless Laplacian spectral radius of graphs with fixed number of branch vertices
