On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
DOI10.1186/S13660-017-1395-YzbMATH Open1367.05129OpenAlexW2617405030WikidataQ33715515 ScholiaQ33715515MaRDI QIDQ2012334FDOQ2012334
Authors: Rong Zhang, Shu-Guang Guo
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
Recommendations
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
- The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
- On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Hamilton cycles and eigenvalues of graphs
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- The smallest eigenvalue of the signless Laplacian
- The least eigenvalue of signless Laplacian of graphs under perturbation
- A characterization of the smallest eigenvalue of a graph
- The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- The domination number and the least \(Q\)-eigenvalue
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- On the least signless Laplacian eigenvalues of some 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
- 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
- Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
- The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
- The smallest signless Laplacian eigenvalue of graphs under perturbation
Cited In (13)
- Non-bipartite graphs with third largest Laplacian eigenvalue less than three
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- On the least signless Laplacian eigenvalues of some graphs
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
- Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
- On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph
- The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
- The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
- On the least signless Laplacian eigenvalue of non-bipartite unicyclic graphs with both given order and diameter.
- The least eigenvalue of signless Laplacian of graphs under perturbation
- A note on the least eigenvalue of a graph with given maximum degree
- The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
This page was built for publication: On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012334)