Search

Given a graph G with vertices { v 1 , ... , v n } , we define S (G) to be the set of symmetric matrices A = [ a i , j ] such that for i ≠ j we have a i , j ≠ 0 if and only if v i v j ∈ E (G). Motivated by the Graph Complement Conjecture, we say that a graph G is complementary vanishing if there exist matrices A ∈ S (G) and B ∈ S (G ‾) such that A B = O. We provide combinatorial conditions for when a graph is or is not complementary vanishing, and we characterize which graphs are complementary vanishing in terms of certain minimal complementary vanishing graphs. In addition to this, we determine which graphs on at most 8 vertices are complementary vanishing. [ABSTRACT FROM AUTHOR]