In mathematics, in graph theory, the Seidel adjacency matrix of a simple graph G (also called the Seidel matrix and—the original name—the (1,1,0)-adjacency matrix) is the symmetric matrix with a row and column for each vertex, having 0 on the diagonal and, in the positions ...