Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue

DOI10.1186/s13660-016-1077-1zbMath1337.05071OpenAlexW2346027120WikidataQ59467374 ScholiaQ59467374MaRDI QIDQ289954

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

zbMATH Keywords

unicyclic graphsignless Laplacianleast eigenvaluependant vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Ordering \(Q\)-indices of graphs: given size and circumference ⋮ On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree ⋮ Least eigenvalue of the connected graphs whose complements are cacti

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The domination number and the least \(Q\)-eigenvalue
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• The smallest eigenvalue of the signless Laplacian
• 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 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
• 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: Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue