On the signless Laplacian spectra of \(k\)-trees
From MaRDI portal
Publication:477752
DOI10.1016/j.laa.2014.11.010zbMath1304.05098arXiv1507.02536MaRDI QIDQ477752
Publication date: 9 December 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.02536
05C05: Trees
05C35: Extremal problems in graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Extremal Halin graphs with respect to the signless Laplacian spectra, Corrigendum to: ``On the signless Laplacian spectra of \(k\)-trees, On maximum Estrada indices of \(k\)-trees, The spectra and the signless Laplacian spectra of graphs with pockets, On maximum signless Laplacian Estrada indices of \(k\)-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- On the signless Laplacian index of cacti with a given number of pendant vertices
- On the signless Laplacian index of unicyclic graphs with fixed diameter
- Signless Laplacians of finite graphs
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Spectra of digraphs
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Bounds and conjectures for the signless Laplacian index of graphs
- Independence polynomials of \(k\)-tree related graphs
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- The signless Laplacian spread
- Laplacian matrices of graphs: A survey
- Which graphs are determined by their spectrum?
- Tree-width, clique-minors, and eigenvalues.
- On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
- Which \(k\)-trees are cover-incomparability graphs?
- A conjecture on the diameter and signless Laplacian index of graphs
- Counting unlabeled \(k\)-trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- A Spectral Erdős–Stone–Bollobás Theorem
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- Ancestors and descendants in evolving k‐tree models
- The number of labeled k-dimensional trees
- Maxima of the Q-index: graphs with bounded clique number