Graphs whose positive semi-definite matrices have nullity at most two

By H. Holst. 2003

66 citations recorded by the source corpus.

Subfields: Algebra and Number Theory, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/c36d022a32717531631cddf22740838b5cb1f822

How researchers see this paper

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

In Algebra and Number Theory

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

In Computational Theory and Mathematics

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

In Geometry and Topology

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

Citations in the corpus

• The minimum rank of symmetric matrices described by a graph: A survey☆ (2007, unknown): “[33] The following statements are equivalent.”
• Zero forcing parameters and minimum rank problems (2010, methodology): “| over all positive semidefinite zero forcing sets X ⊆ VG (using the positive semidefinite color change rule).”
• GRAPHS WHOSE MINIMAL RANK IS TWO (2004, result): “Van der Holst considered the parameter τ(G) in [6], the largest nullity of an n-by-n Hermitian positive semidefinite matrix with graph G (without the transversality condition), and building upon the results in [3] was able to characterize those graphs G with τ(G) ≤ 1 and τ(G) ≤ 2.”