The inverse nullity pair problem and the strong nullity interlacing property
Authors:
- Aida AbiadAAAida Abiad
- Bryan A. CurtisBCBryan A. Curtis
- Mary FlaggMFMary Flagg
- H. Tracy HallHHH. Tracy Hall
- Jephian C.-H. LinJLJephian C.-H. Lin
- Bryan ShaderBSBryan Shader
- 18 July 2024
- journal article
- research article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 699, 539-568
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation Division of Mathematical Sciences
- National Science and Technology Council
- Dutch Research Council
- American Institute of Mathematics
- National Science Foundation
This publication has 16 references indexed in Scilit:
- The inverse eigenvalue problem of a graph: Multiplicities and minorsJournal of Combinatorial Theory, Series B, 2020
- Construction of matrices with a given graph and prescribed interlaced spectral dataLinear Algebra and its Applications, 2013
- Graph minors XXIII. Nash-Williams' immersion conjectureJournal of Combinatorial Theory, Series B, 2010
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexampleLinear Algebra and its Applications, 2009
- Computation of minimal rank and path cover number for certain graphsLinear Algebra and its Applications, 2004
- Sur un nouvel invariant des graphes et un critère de planaritéJournal of Combinatorial Theory, Series B, 1990
- Spectral multiplicity and splitting results for a class of qualitative matricesLinear Algebra and its Applications, 1984
- Construction of a Jacobi matrix from spectral dataLinear Algebra and its Applications, 1976
- Inverse eigenvalue problems for Jacobi matricesLinear Algebra and its Applications, 1976
- On the construction of a Jacobi matrix from spectral dataLinear Algebra and its Applications, 1974