Linearly independent vertices and minimum semidefinite rank

By Philip Hackney, Benjamin Harris, Margaret Lay, Lon H. Mitchell, S. Narayan, Amanda Pascoe. 2009

58 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/36f1b80693ac818d9ce96ef61f4b448fead94e40

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Leslie Hogben
2. Shaun M. Fallat
3. Darren D. Row
4. Bryan L. Shader
5. Wayne W. Barrett
6. Francesco Barioli
7. H. Tracy Hall
8. Pauline van den Driessche

In Electrical and Electronic Engineering

1. Leslie Hogben
2. Shaun M. Fallat
3. Darren D. Row

In Geometry and Topology

1. Leslie Hogben
2. Shaun M. Fallat
3. Darren D. Row
4. Wayne W. Barrett
5. Francesco Barioli
6. H. Tracy Hall
7. Bryan L. Shader
8. Pauline van den Driessche

Citations in the corpus

• Zero forcing parameters and minimum rank problems (2010, background): “There has also been considerable interest in the related positive semidefinite minimum rank problem, where the minimum rank is taken over (real or complex Hermitian) positive semidefinite matrices described by a graph (see, for example, [4, 6, 10, 12, 13, 15]).”
• Positive semidefinite zero forcing (2013, background): “The reader is referred to [14] for the definition of OS-set and OS(G).”