Least Q-eigenvalue of a graph

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

zbMATH Keywords

diameternon-bipartite graph\(Q\)-eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Cited In (4)

• Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
• The least eigenvalue of graphs with given connectivity
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
• 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)