Minimum-rank matrices with prescribed graph

DOI10.1016/0024-3795(95)00238-3zbMath0864.05069OpenAlexW2007200333MaRDI QIDQ2564937

Peter M. Nylen

Publication date: 22 June 1997

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

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00238-3

zbMATH Keywords

treesymmetric matrixconnected graphstructured matricesappropriate vertexrank matrices

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (32)

The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample ⋮ Computation of minimal rank and path cover number for certain graphs ⋮ Minimum rank problems ⋮ Maximum nullity of outerplanar graphs and the path cover number ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ Improved Computational Approaches and Heuristics for Zero Forcing ⋮ Decompositions of minimum rank matrices ⋮ Connected power domination in graphs ⋮ Minimum rank of outerplanar graphs ⋮ Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph ⋮ Sparks of symmetric matrices and their graphs ⋮ Positive semidefinite zero forcing ⋮ The structure of matrices with a maximum multiplicity eigenvalue ⋮ On the minimum semidefinite rank of a simple graph ⋮ On acyclic and unicyclic graphs whose minimum rank equals the diameter ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ The maximum corank of graphs with a 2-separation ⋮ Unitary matrix digraphs and minimum semidefinite rank ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Complexity and computation of connected zero forcing ⋮ A note on universally optimal matrices and field independence of the minimum rank of a graph ⋮ Minimum rank and path cover number for generalized and double generalized cycle star graphs ⋮ The minimum rank of symmetric matrices described by a graph: a survey ⋮ The minimum rank problem over the finite field of order 2: Minimum rank 3 ⋮ Smith normal form and acyclic matrices ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic ⋮ On the difference between the maximum multiplicity and path cover number for tree-like graphs ⋮ Rational realizations of the minimum rank of a sign pattern matrix ⋮ Null space structure of tree-patterned matrices ⋮ On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree ⋮ On the rank spread of graphs

Cites Work

• Unnamed Item
• Spectral multiplicity and splitting results for a class of qualitative matrices
• Construction of acyclic matrices from spectral data
• Mechanical vibration trees
• Matrices with prescribed off-diagonal elements
• A note on eigenvalues of fixed rank perturbations of diagonal matrices
• Eigenvectors of acyclic matrices
• Realizations of interlacing by tree-patterned matrics
• The rank and eigenvalues of main diagonal perturbed matrices
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: Minimum-rank matrices with prescribed graph