Least Q-eigenvalue of a graph
From MaRDI portal
Publication:4901552
DOI10.3969/J.ISSN.1000-5641.2012.03.001zbMATH Open1265.05373MaRDI QIDQ4901552FDOQ4901552
Authors: Min Zhou, Changxiang He
Publication date: 24 January 2013
Recommendations
- Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs
- On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Further results on the least \(Q\)-eigenvalue of a graph with fixed domination number
- The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
Cited In (10)
- A generalization of a perturbation theorem on the least \(Q\)-eigenvalue and its application
- The domination number and the least \(Q\)-eigenvalue
- The least \(Q\)-eigenvalue with fixed domination number
- Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
- The least eigenvalue of graphs with given connectivity
- Further results on the least \(Q\)-eigenvalue of a graph with fixed domination number
- Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs
- Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
- On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
- A relaxed projection method for split variational inequalities
This page was built for publication: Least \(Q\)-eigenvalue of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4901552)