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

DOI10.1080/03081087.2020.1754324MaRDI QIDQ5069203zbMATH OpenOpenAlexFDO

Authors Shu-Guang Guo, Rong Zhang

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

least eigenvaluesignless Laplacianunicyclic graphupper bound

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)

Recommendations

• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching
• Maximizing the least signless Laplacian eigenvalue of unicyclic graphs
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• scientific article; zbMATH DE number 4043884
• On the least eigenvalue of a unicyclic mixed graph
• The least eigenvalue of graphs whose complements are unicyclic
• Maximizing the largest eigenvalues of signed unicyclic graphs
• On unicyclic graphs with uniquely restricted maximum matchings
• The largest eigenvalue of unicyclic graphs
• On minimal energies of unicyclic graphs with perfect matching

Cites work

• A characterization of the smallest eigenvalue of a graph
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• A sharp upper bound on the least signless Laplacian eigenvalue using domination number
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• Maximizing the least signless Laplacian eigenvalue of unicyclic graphs
• On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph.
• On the least Q-eigenvalue of a non-bipartite Hamiltonian graph
• On the least signless Laplacian eigenvalues of some graphs
• Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
• Signless Laplacians of finite graphs
• The clique number and the smallest \(Q\)-eigenvalue of graphs
• The domination number and the least \(Q\)-eigenvalue
• The least \(Q\)-eigenvalue with fixed domination number
• The least eigenvalue of signless Laplacian of graphs under perturbation
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
• The least eigenvalue of the signless Laplacian of the complements of trees
• 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 smallest eigenvalue of the signless Laplacian
• The smallest signless Laplacian eigenvalue of graphs under perturbation

Cited in

(1)

• On the smallest positive eigenvalue of bipartite unicyclic graphs with a unique perfect matching

This page was built for publication: Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069203)