Extremal problems on linear combinations of graph eigenvalues

DOI10.1016/J.LAA.2026.09.020MaRDI QIDQ7411450zbMATH OpenFDO

Authors Lele Liu, Huan Wang

Publication date 2027

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.LAA.2026.09.020

zbMATH Keywords

\(A_\alpha\)-matrixalgebraic connectivityextremal eigenvalueskite graphsignless Laplacian spectral radiusspectral graph theoryspectral inequalities

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• A sharp upper bound of the spectral radius of graphs
• A survey of automated conjectures in spectral graph theory
• Bounds and conjectures for the signless Laplacian index of graphs
• Conjectures on index and algebraic connectivity of graphs
• Graph theory
• Graph theory
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Linear combinations of graph eigenvalues
• Maximizing signless Laplacian or adjacency spectral radius of graphs subject to fixed connectivity
• Merging the \(A\)- and \(Q\)-spectral theories
• On graphs whose signless Laplacian index does not exceed 4.5
• On the second eigenvalue of a graph
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II
• The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
• Towards a spectral theory of graphs based on the signless Laplacian. I
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index

This page was built for publication: Extremal problems on linear combinations of graph eigenvalues

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