The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample

DOI10.1016/j.laa.2009.04.007zbMath1175.05032OpenAlexW1997260521WikidataQ125027445 ScholiaQ125027445MaRDI QIDQ836996

H. Tracy Hall, Wayne W. Barrett, Raphael Loewy

Publication date: 10 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.laa.2009.04.007

zbMATH Keywords

treegraphinertiasymmetricminimum rankHermitiancombinatorial matrix theory

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hermitian, skew-Hermitian, and related matrices (15B57) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (22)

Using a new zero forcing process to guarantee the strong Arnold property ⋮ The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph ⋮ The inertia set of a signed graph ⋮ The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Ordered multiplicity inverse eigenvalue problem for graphs on six vertices ⋮ Decompositions of minimum rank matrices ⋮ Expansion formulas for the inertias of Hermitian matrix polynomials and matrix pencils of orthogonal projectors ⋮ The \(q\)-analogue of zero forcing for certain families of graphs ⋮ Minimum rank of outerplanar graphs ⋮ Computing inertia sets using atoms ⋮ The inertia set of the join of graphs ⋮ The inverse inertia problem for the complements of partial \(k\)-trees ⋮ Unnamed Item ⋮ Graphs that allow all the eigenvalue multiplicities to be even ⋮ On the inertia set of a signed tree with loops ⋮ Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications ⋮ On minimum rank and zero forcing sets of a graph ⋮ On the inertia set of a signed graph with loops ⋮ The minimum rank problem for circulants ⋮ The minimum rank problem over the finite field of order 2: Minimum rank 3 ⋮ The inertia sets of graphs with a 2-separation ⋮ The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic

Cites Work

• Unnamed Item
• On the minimum rank of the join of graphs and decomposable graphs
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• Inverse eigenvalue problems for Jacobi matrices
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars.
• Graphs whose positive semi-definite matrices have nullity at most two
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• Computation of minimal rank and path cover number for certain graphs
• Toughness in graphs -- a survey
• A characterization of tridiagonal matrices
• Tough graphs and Hamiltonian circuits.
• Minimum-rank matrices with prescribed graph
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• The graphs for which the maximum multiplicity of an eigenvalue is two
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• Graphs whose minimal rank is two
• Graphs whose minimal rank is two: The finite fields case
• The largest eigenvalue of a graph: A survey
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs

This page was built for publication: The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample