The inverse inertia problem for the complements of partial \(k\)-trees
From MaRDI portal
Publication:2435477
DOI10.1016/j.laa.2013.06.011zbMath1283.05061arXiv1210.7004OpenAlexW2094284126MaRDI QIDQ2435477
Publication date: 19 February 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.7004
Cites Work
- Unnamed Item
- Unnamed Item
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Orthogonal representations, minimum rank, and graph complements
- The minimum rank of symmetric matrices described by a graph: a survey
- A partial k-arboretum of graphs with bounded treewidth
- Zero forcing sets and the minimum rank of graphs
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Graphs whose minimal rank is two
- Graphs whose minimal rank is two: The finite fields case