The Laplacian spectral radius of some bipartite graphs
From MaRDI portal
Publication:2477539
DOI10.1016/j.laa.2007.10.007zbMath1134.05066OpenAlexW2076499150MaRDI QIDQ2477539
Publication date: 14 March 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.10.007
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items
Maximizing the \(A_\alpha \)-spectral radius of graphs with given size and diameter, Maximizing the signless Laplacian spectral radius of \(k\)-connected graphs with given diameter, Some results on Laplacian spectral radius of graphs with cut vertices, Distance Laplacian spectral radius of the complements of trees and unicyclic graphs, Bounds on the eigenvalues of graphs with cut vertices or edges, On the Laplacian spectral radii of bipartite graphs, On the Laplacian spectral radius of bipartite graphs with fixed order and size, The Laplacian spectral radius of bicyclic graphs with a given girth, Interlacing eigenvalues on some operations of graphs, Maximizing the Laplacian spectral radii of graphs with given diameter, The Laplacian spectral radius of some graphs, Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
Cites Work
- Unnamed Item
- Unnamed Item
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- A new upper bound for the Laplacian spectral radius of graphs
- On the spectral radius of graphs with cut edges
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- The Laplacian Spectrum of a Graph
- Matrix Analysis
- On the spectral radius of bicyclic graphs