A conjecture on the diameter and signless Laplacian index of graphs
From MaRDI portal
Publication:2448235
DOI10.1016/j.laa.2014.03.005zbMath1286.05093OpenAlexW1986187391WikidataQ123137527 ScholiaQ123137527MaRDI QIDQ2448235
Publication date: 30 April 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2014.03.005
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Distance in graphs (05C12) Signed and weighted graphs (05C22)
Related Items
Maxima of the \(Q\)-index: graphs with no \(K_{1,t}\)-minor ⋮ Bounds on the independence number and signless Laplacian index of graphs ⋮ On the signless Laplacian spectra of \(k\)-trees ⋮ On the \(\alpha\)-index of graphs with pendent paths ⋮ On the signless Laplacian index and radius of graphs ⋮ Computing the maximal signless Laplacian index among graphs of prescribed order and diameter ⋮ The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
Cites Work
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Signless Laplacian spectral radii of graphs with given chromatic number
- On the signless Laplacian index of unicyclic graphs with fixed diameter
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- Signless Laplacians of finite graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- Bounds and conjectures for the signless Laplacian index of graphs
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Graphs with maximal signless Laplacian spectral radius
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Eigenvalue bounds for the signless laplacian
- Towards a spectral theory of graphs based on the signless Laplacian, I
- 围长为<italic>g</italic>且有<italic>k</italic>个悬挂点的单圈图的谱半径和Laplacian谱半径
