Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings

DOI10.1080/03081087.2020.1754324zbMath1486.05179OpenAlexW3043238954MaRDI QIDQ5069203

Rong Zhang, Shu-Guang Guo

Publication date: 8 April 2022

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2020.1754324

zbMATH Keywords

upper boundunicyclic graphsignless Laplacianleast eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• The clique number and the smallest \(Q\)-eigenvalue of graphs
• The domination number and 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
• Maximizing the least signless Laplacian eigenvalue of unicyclic graphs
• The smallest eigenvalue of the signless Laplacian
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
• The least \(Q\)-eigenvalue with fixed domination number
• 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
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials 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: Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings