Inverse eigenvalue problem for Laplacian matrices of a graph

DOI10.1137/24M1714472MaRDI QIDQ6936078zbMATH OpenFDO

Authors Shaun M. Fallat, Himanshu Gupta, Jephian Chin-Hung Lin

Publication date 2 September 2025

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1714472

zbMATH Keywords

generalized Laplacian matricesgradient descentinverse eigenvalue problemsmultiplicity listsquadratic programmingvariance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57) Numerical solutions to inverse eigenvalue problems (65F18)

Cites work

• An upper bound on the sum of squares of degrees in a graph
• Eigenvalues of nonnegative symmetric matrices
• Eigenvalues, multiplicities and graphs
• Explicit inverses of some tridiagonal matrices
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Graphs and matrices
• Inverse eigenvalue problems for Jacobi matrices
• Inverse Problems and Zero Forcing for Graphs
• Matrix Analysis
• Maximizing the sum of the squares of the degrees of a graph
• On some inverse problems in matrix theory
• On the construction of a Jacobi matrix from spectral data
• The minimum rank of symmetric matrices described by a graph: a survey

Cited in

(1)

• Inverse eigenvalue problem for discrete Schrödinger operators of a graph

This page was built for publication: Inverse eigenvalue problem for Laplacian matrices of a graph

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