The least signless Laplacian eignvalue of the complements of unicyclic graphs
From MaRDI portal
Publication:1735455
DOI10.1016/j.amc.2017.02.018zbMath1411.05175OpenAlexW2591894085MaRDI QIDQ1735455
Yi-Zheng Fan, Miao-Lin Ye, Gui-Dong Yu
Publication date: 28 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.02.018
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45)
Related Items (4)
The distance eigenvalues of the complements of unicyclic graphs ⋮ 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 ⋮ On spectra and spectral radius of Signless Laplacian of power graphs of some finite groups
Cites Work
- Unnamed Item
- Signless Laplacians of finite graphs
- Unoriented Laplacian maximizing graphs are degree maximal
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Towards a spectral theory of graphs based on the signless Laplacian. II.
- The signless Laplacian spectral radius of graphs with given degree sequences
- Bounds on the index of the signless Laplacian of a graph
- Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
- 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
- Signless Laplacian spectral radius and Hamiltonicity
- Algebraic graph theory without orientation
- Enumeration of cospectral graphs.
- Graphs with maximal signless Laplacian spectral radius
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
- The least eigenvalue of the signless Laplacian of the complements of trees
- 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
- Towards a spectral theory of graphs based on the signless Laplacian, III
- Signless Laplacians and line graphs
- Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
- On the least signless Laplacian eigenvalues of some graphs
This page was built for publication: The least signless Laplacian eignvalue of the complements of unicyclic graphs