On the least signless Laplacian eigenvalue of a P_t-free non-bipartite connected graph

zbMATH Open1349.05214MaRDI QIDQ2992230FDOQ2992230

Authors: Xiaorong Liu, Shu-Guang Guo, Rong Zhang 

Publication date: 10 August 2016

Recommendations

• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• The least signless Laplacian eigenvalue of non-bipartite graphs with given stability number
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs

zbMATH Keywords

least eigenvaluesignless Laplaciannon-bipartite connected graphnon-bipartite unicyclic graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Cited In (5)

• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
• On the sign patterns of the smallest signless Laplacian eigenvector

This page was built for publication: On the least signless Laplacian eigenvalue of a \(P_t\)-free non-bipartite connected graph

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