On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
From MaRDI portal
Publication:1680292
DOI10.1016/J.LAA.2017.10.012zbMath1374.05157OpenAlexW2766391933MaRDI QIDQ1680292
Publication date: 15 November 2017
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2017.10.012
Related Items (5)
Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings ⋮ Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs ⋮ On the least eigenvalue of \(A_\alpha \)-matrix of graphs ⋮ Further results on the least Q-eigenvalue of a graph with fixed domination number ⋮ Bounds on signless Laplacian eigenvalues of Hamiltonian graphs
Cites Work
- 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
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Hamilton cycles and eigenvalues of graphs
- 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
- The smallest signless Laplacian eigenvalue of graphs under perturbation
- 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: On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph