Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
From MaRDI portal
Publication:289954
DOI10.1186/S13660-016-1077-1zbMATH Open1337.05071OpenAlexW2346027120WikidataQ59467374 ScholiaQ59467374MaRDI QIDQ289954FDOQ289954
Xiaorong Liu, Guanglong Yu, Shu-Guang Guo, Rong Zhang
Publication date: 1 June 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1077-1
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- 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
- 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
- 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
Cited In (4)
This page was built for publication: Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289954)
