Bounds for minimum semidefinite rank from superpositions and cutsets

DOI10.1016/J.LAA.2012.07.012MaRDI QIDQ389675zbMATH OpenOpenAlexFDO

Authors Jonathan E. Beagley, S. K. Narayan, Sara P. Rimer, Andrew M. Zimmer, Lon H. Mitchell, Eileen Radzwion, Rachael Tomasino, Jennifer Wolfe

Publication date 21 January 2014

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

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

zbMATH Keywords

cutsetsminimum semidefinite ranksuperposition of graphsvector representation of a graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• A new lower bound for the positive semidefinite minimum rank of a graph
• Lower bounds in minimum rank problems
• Bounds on minimum semidefinite rank of graphs
• On the minimum semidefinite rank of a simple graph
• Bounds on the sum of minimum semidefinite rank of a graph and its complement

Cites work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Graphs whose minimal rank is two
• Graphs whose positive semi-definite matrices have nullity at most two
• Linearly independent vertices and minimum semidefinite rank
• Lower bounds in minimum rank problems
• On the maximum positive semi-definite nullity and the cycle matroid of graphs
• On the minimum semidefinite rank of a simple graph
• The minimum rank of symmetric matrices described by a graph: a survey
• Vector representations of graphs
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(5)

• Lower bounds in minimum rank problems
• On the complexity of ``Superdetermined minrank instances
• Positive semidefinite zero forcing numbers of two classes of graphs
• The minimum semidefinite rank of a triangle-free graph
• Linearly independent vertices and minimum semidefinite rank

This page was built for publication: Bounds for minimum semidefinite rank from superpositions and cutsets

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