The minimum semidefinite rank of the complement of partial \(k\)-trees
From MaRDI portal
Publication:627949
DOI10.1016/j.laa.2010.11.013zbMath1213.05173MaRDI QIDQ627949
Hein van der Holst, John Sinkovic
Publication date: 4 March 2011
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.11.013
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
15A18: Eigenvalues, singular values, and eigenvectors
15A03: Vector spaces, linear dependence, rank, lineability
Related Items
Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Graph complement conjecture for classes of shadow graphs, Unnamed Item, On the graph complement conjecture for minimum rank, On the graph complement conjecture for minimum semidefinite rank, Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph, The inverse inertia problem for the complements of partial \(k\)-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. XX: Wagner's conjecture
- Orthogonal representations, minimum rank, and graph complements
- Three-connected graphs whose maximum nullity is at most three
- The minimum rank of symmetric matrices described by a graph: a survey
- Sur une hypothèse de transversalité d'Arnold. (About a transversality hypothesis of Arnold)
- A partial k-arboretum of graphs with bounded treewidth
- The Colin de Verdière number and sphere representations of a graph
- Multiplicities of eigenvalues and tree-width of graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- 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
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
