Co-eigenvector graphs

Except for the empty graph, we show that the orthogonal matrix X of the adjacency matrix A determines that adjacency matrix completely, but not always uniquely. The proof relies on interesting properties of the Hadamard product Ξ=X∘X. As a consequence of the theory, we show that irregular co-eigenve... View More