On signed graphs and gramians

Let A be a symmetric matrix with entries (0, 1, -1) and λ1(A) its smallest eigenvalue. We consider the question of how closely A-λ1(A)I can be approximated by a gramian KKT, where each entry in K is 0, 1, or -1. © 1977 D. Reidel Publishing Company.