On the signless Laplacian index of unicyclic graphs with fixed diameter
From MaRDI portal
Publication:648944
DOI10.1016/j.laa.2011.07.002zbMath1229.05201OpenAlexW1998561326MaRDI QIDQ648944
Publication date: 29 November 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.07.002
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12)
Related Items (7)
Extremal Halin graphs with respect to the signless Laplacian spectra ⋮ On the \(\alpha\)-spectral radius of unicyclic and bicyclic graphs with a fixed diameter ⋮ Bounds on the independence number and signless Laplacian index of graphs ⋮ The minimum harmonic index for unicyclic graphs with given diameter ⋮ A conjecture on the diameter and signless Laplacian index of graphs ⋮ The Harary index of all unicyclic graphs with given diameter ⋮ On the signless Laplacian spectra of \(k\)-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the index of necklaces
- On the spectral radius of quasi-\(k\)-cyclic graphs
- Signless Laplacians of finite graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- Ordering trees with \(n\) vertices and matching number \(q\) by their largest Laplacian eigenvalues
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- The signless Laplacian spectral radius of graphs with given degree sequences
- On the signless Laplacian spectral radius of graphs with cut vertices
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- The signless Laplacian spread
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Graphs with maximal signless Laplacian spectral radius
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Maximizing the signless Laplacian spectral radius of graphs with given diameter or cut vertices
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- The maximum clique and the signless Laplacian eigenvalues
- Towards a spectral theory of graphs based on the signless Laplacian, I
- On three conjectures involving the signless Laplacian spectral radius of graphs
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- Towards a spectral theory of graphs based on the signless Laplacian, III
This page was built for publication: On the signless Laplacian index of unicyclic graphs with fixed diameter