On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
From MaRDI portal
Publication:2012334
DOI10.1186/s13660-017-1395-yzbMath1367.05129OpenAlexW2617405030WikidataQ33715515 ScholiaQ33715515MaRDI QIDQ2012334
Publication date: 31 July 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1395-y
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Cites Work
- Unnamed Item
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- The domination number and the least \(Q\)-eigenvalue
- Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- The smallest eigenvalue of the signless Laplacian
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Hamilton cycles and eigenvalues of graphs
- The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
- The least eigenvalue of signless Laplacian of graphs under perturbation
- The least eigenvalue of the signless Laplacian of the complements of trees
- The smallest signless Laplacian eigenvalue of graphs under perturbation
- A characterization of the smallest eigenvalue of a graph
- 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: On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree