The least signless Laplacian eignvalue of the complements of unicyclic graphs
From MaRDI portal
(Redirected from Publication:1735455)
Recommendations
- The least eigenvalue of the signless Laplacian of the complements of trees
- The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
- The least eigenvalue of graphs whose complements are unicyclic
- The second least eigenvalue of the signless Laplacian of the complements of trees
- On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees
Cites work
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Algebraic graph theory without orientation
- Bounds on the index of the signless Laplacian of a graph
- Enumeration of cospectral graphs.
- Graphs with maximal signless Laplacian spectral radius
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
- On the least signless Laplacian eigenvalues of some graphs
- On the maximal signless Laplacian spectral radius of graphs with given matching number
- Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Signless Laplacian spectral radius and Hamiltonicity
- Signless Laplacians and line graphs
- Signless Laplacians of finite graphs
- The least eigenvalue of the signless Laplacian of the complements of trees
- The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
- The maximum clique and the signless Laplacian eigenvalues
- The signless Laplacian spectral radius of graphs with given chromatic number
- The signless Laplacian spectral radius of graphs with given degree sequences
- The signless Laplacian spectral radius of graphs with given number of pendant vertices
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- Unoriented Laplacian maximizing graphs are degree maximal
Cited in
(10)- The distance eigenvalues of the complements of unicyclic graphs
- On distance signless Laplacian spectrum of the complements of unicyclic graphs and trees
- The least eigenvalue of graphs whose complements are unicyclic
- The least eigenvalue of the signless Laplacian of the complements of trees
- On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter.
- On spectra and spectral radius of signless Laplacian of power graphs of some finite groups
- scientific article; zbMATH DE number 6795057 (Why is no real title available?)
- The least eigenvalue of the complements of trees
- The distance spectrum of the complements of graphs of diameter greater than three
- The distance spectrum of the complements of graphs with two pendent vertices
This page was built for publication: The least signless Laplacian eignvalue of the complements of unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1735455)