scientific article; zbMATH DE number 7640506
From MaRDI portal
Publication:5060662
F. Scott Dahlgren, Derek S. Young, Sara M. Motlaghian, Zachary Gershkoff, Leslie Hogben
Publication date: 11 January 2023
Full work available at URL: https://arxiv.org/abs/2202.02633
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
inverse eigenvalue problemminimum rankmaximum nullitymaximum multiplicityhollow matrixminimum number of distinct eigenvaluesordered multiplicity list
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Hermitian, skew-Hermitian, and related matrices (15B57)
Related Items (1)
Cites Work
- Minimum rank of skew-symmetric matrices described by a graph
- A note on ``Methods for constructing distance matrices and the inverse eigenvalue problem
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Zero forcing sets and the minimum rank of graphs
- Unitary matrix digraphs and minimum semidefinite rank
- Locality for quantum systems on graphs depends on the number field
- Inverse spectral problem for finite Jacobi matrices with zero diagonal
- A further look into combinatorial orthogonality
- The Determinant of the Adjacency Matrix of a Graph
- On the Digraph of a Unitary Matrix
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
- Minimum rank with zero diagonal
- Minimum number of distinct eigenvalues of graphs
- Matrix theory. Basic results and techniques
This page was built for publication:
