On the least signless Laplacian eigenvalues of some graphs

DOI10.13001/1081-3810.1671zbMath1282.05162OpenAlexW213539276MaRDI QIDQ5746823

Shu-Guang Guo, Meiling Xu, Guanglong Yu

Publication date: 10 February 2014

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7285a93f4bb05f71b9f9a5bc09118a87584b64cc

zbMATH Keywords

perturbationmatching numbersignless Laplacianleast eigenvalueedge cover number

Mathematics Subject Classification ID

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

Related Items (9)

The domination number and the least \(Q\)-eigenvalue ⋮ Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue ⋮ Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph ⋮ The least signless Laplacian eignvalue of the complements of unicyclic graphs ⋮ The least \(Q\)-eigenvalue with fixed domination number ⋮ On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree ⋮ Further results on the least Q-eigenvalue of a graph with fixed domination number ⋮ The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number

This page was built for publication: On the least signless Laplacian eigenvalues of some graphs