Positive semidefinite zero forcing

By Jason Ekstrand, Craig Erickson, H. Tracy Hall, D. Hay, Leslie Hogben, R. Johnson, N. Kingsley, S. Osborne, Travis Peters, J. Roat and 4 more. Linear Algebra and its Applications, 2013

61 citations recorded by the source corpus.

Abstract The positive semidefinite zero forcing number Z + ( G ) of a graph G was introduced in Barioli et al. (2010) [4] . We establish a variety of properties of Z + ( G ) : Any vertex of G can be in a minimum positive semidefinite zero forcing set (this is not true for standard zero forcing). The graph parameters tw ( G ) (tree-width), Z + ( G ) , and Z ( G ) (standard zero forcing number) all satisfy the Graph Complement Conjecture (see Barioli et al. (2012) [3] ). Graphs having extreme values of the positive semidefinite zero forcing number are characterized. The effect of various graph operations on positive semidefinite zero forcing number and connections with other graph parameters are studied.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/514ad20707a9730445581934a27dfcaa2149f190