Computing positive semidefinite minimum rank for small graphs

DOI10.2140/INVOLVE.2014.7.595MaRDI QIDQ399449zbMATH OpenOpenAlexFDO

Authors Steven Osborne, Nathan Warnberg

Publication date 19 August 2014

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2014.7.595

zbMATH Keywords

maximum nullityminimum rankpositive semidefinitezero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Techniques for determining the minimum rank of a small graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the minimum rank among positive semidefinite matrices and tree size of a given graph of at most seven vertices
• A new lower bound for the positive semidefinite minimum rank of a graph
• On the minimum semidefinite rank of a simple graph

Cited in

(4)

• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• On the graph complement conjecture for minimum semidefinite rank
• On the minimum rank among positive semidefinite matrices and tree size of a given graph of at most seven vertices
• Techniques for determining the minimum rank of a small graph

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: Computing positive semidefinite minimum rank for small graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q399449)