On the graph complement conjecture for minimum semidefinite rank
DOI10.1016/J.LAA.2011.03.011zbMATH Open1221.05240OpenAlexW2063369945WikidataQ123014379 ScholiaQ123014379MaRDI QIDQ551287FDOQ551287
Authors: Lon H. Mitchell 
Publication date: 15 July 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.2011.03.011
Recommendations
- On the graph complement conjecture for minimum rank
- Bounds on the sum of minimum semidefinite rank of a graph and its complement
- On the minimum semidefinite rank of a simple graph
- Bounds on minimum semidefinite rank of graphs
- On the minimum semidefinite rank of signed graphs
- On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
- A new lower bound for the positive semidefinite minimum rank of a graph
- The minimum semidefinite rank of a triangle-free graph
- Computing positive semidefinite minimum rank for small graphs
- Subgraph complementation and minimum rank
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)
Cites Work
- A partial k-arboretum of graphs with bounded treewidth
- Title not available (Why is that?)
- On Complementary Graphs
- Multiplicities of eigenvalues and tree-width of graphs
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Zero forcing parameters and minimum rank problems
- The minimum rank of symmetric matrices described by a graph: a survey
- Extreme chordal doubly nonnegative matrices with given row sums
- Linearly independent vertices and minimum semidefinite rank
- On the graph complement conjecture for minimum rank
- The minimum semidefinite rank of the complement of partial \(k\)-trees
- More on extremal positive semidefinite doubly stochastic matrices
Cited In (9)
- Bounds on minimum semidefinite rank of graphs
- Graph complement conjecture for classes of shadow graphs
- The minimum semidefinite rank of a triangle-free graph
- On the minimum vector rank of multigraphs
- Bounds on the sum of minimum semidefinite rank of a graph and its complement
- On the minimum semidefinite rank of a simple graph
- Sphere representations, stacked polytopes, and the Colin de Verdière number of a graph
- Minimum semidefinite rank of outerplanar graphs and the tree cover number
- Positive semidefinite zero forcing
This page was built for publication: On the graph complement conjecture for minimum semidefinite rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551287)
