Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs

DOI10.1016/j.dam.2021.02.032zbMath1462.05247arXiv1911.12541OpenAlexW3139002783MaRDI QIDQ2022508

Lin Sun, Chao Yan, Hailiang Zhang, Yarong Wu, Guanglong Yu

Publication date: 29 April 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.12541

zbMATH Keywords

signless Laplacian2-connected graphleast \(Q\)-eigenvaluenonbipartite

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Connectivity (05C40) Sampling theory in information and communication theory (94A20)

Cites Work

• Unnamed Item
• Unnamed Item
• The domination number and the least \(Q\)-eigenvalue
• Bipartiteness and the least eigenvalue of signless Laplacian of graphs
• The smallest eigenvalue of the signless Laplacian
• Graph spectra in computer science
• Signless Laplacians of finite graphs
• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On the least \(Q\)-eigenvalue of a non-bipartite Hamiltonian graph
• The least \(Q\)-eigenvalue with fixed domination number
• Cluster anticonsensus of multiagent systems based on the \(Q\)-theory
• The least eigenvalue of signless Laplacian of graphs under perturbation
• Eigenvalue bounds for the signless laplacian
• Further results on the least Q-eigenvalue of a graph with fixed domination number

This page was built for publication: Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs