On the signless Laplacian spectra of k-trees
From MaRDI portal
Recommendations
- On maximum signless Laplacian Estrada indices of \(k\)-trees
- The signless Laplacian spectral radius of tricyclic graphs and trees with \(k\) pendant vertices
- On the \(Q\)-index and index of triangle-free quasi-tree graphs.
- Upper bounds on the spectral radius of \(k\) trees
- On the maximum signless Laplacian spectral radius of quasi-tree graph
Cites work
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A conjecture on the diameter and signless Laplacian index of graphs
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- A spectral Erdős-Stone-Bollobás theorem
- Ancestors and descendants in evolving k‐tree models
- Bounds and conjectures for the signless Laplacian index of graphs
- Counting unlabeled \(k\)-trees
- Eigenvalues of the Laplacian of a graph∗
- Eigenvectors of acyclic matrices
- Graph theory
- Independence polynomials of \(k\)-tree related graphs
- Laplacian matrices of graphs: A survey
- Maxima of the \(Q\)-index: graphs with bounded clique number
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- 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
- On two conjectures of Randić index and the largest signless Laplacian eigenvalue of graphs
- Sharp bounds for the signless Laplacian spectral radius in terms of clique number
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Signless Laplacians of finite graphs
- Spectra of digraphs
- The number of labeled k-dimensional trees
- The signless Laplacian spread
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Tree-width, clique-minors, and eigenvalues.
- Upper bounds on the spectral radius of \(k\) trees
- Which \(k\)-trees are cover-incomparability graphs?
- Which graphs are determined by their spectrum?
Cited in
(10)- On maximum Estrada indices of \(k\)-trees
- The spectra and the signless Laplacian spectra of graphs with pockets
- Signless Laplacian determination for a family of double starlike trees
- Extremal Halin graphs with respect to the signless Laplacian spectra
- Extremal (balanced) blow-ups of trees with respect to the signless Laplacian index
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- Corrigendum to: ``On the signless Laplacian spectra of \(k\)-trees
- On maximum signless Laplacian Estrada indices of \(k\)-trees
- The second least eigenvalue of the signless Laplacian of the complements of trees
- Trees with Four and Five Distinct Signless Laplacian Eigenvalues
This page was built for publication: On the signless Laplacian spectra of \(k\)-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477752)