Least Q-eigenvalues of nonbipartite 2-connected graphs

DOI10.1016/J.DAM.2021.02.032MaRDI QIDQ2022508zbMATH OpenOpenAlexFDO

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

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

2-connected graphleast \(Q\)-eigenvaluenonbipartitesignless Laplacian

Mathematics Subject Classification ID

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

Abstract: Among all simple nonbipartite 2-connected graphs and among all nonbipartite $heta$-graphs, the minimum least $Q$-eigenvalues are completely determined, respectively.

Recommendations

• Least \(Q\)-eigenvalue of a graph
• On the least Q-eigenvalue of a non-bipartite Hamiltonian graph
• 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
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue

Cites work

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

Cited in

(5)

• On the least Q-eigenvalue of a non-bipartite Hamiltonian graph
• A generalization of a perturbation theorem on the least Q-eigenvalue and its application
• A characterization of the smallest eigenvalue of a graph
• scientific article; zbMATH DE number 6986927 (Why is no real title available?)
• Least \(Q\)-eigenvalue of a graph

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

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