= 1 Although slightly more succinct representations are possible, this method gets close to the information-theoretic lower bound for the minimum number of bits needed to represent all n-vertex graphs. I see no way that you could get an adjacency matrix from a correlation matrix; however, if you describe in more detail, … But, the operation is useful when applied to an adjacency matrix. G If the graph is undirected (i.e. Remark: A convenient help in constructing the adjacency matrix of a relation from a set $$A$$ into a set $$B$$ is to write the elements from $$A$$ in a column preceding the first column of the adjacency matrix, and the elements of $$B$$ in a row above the first row. Discussion. 1 λ {\displaystyle \lambda (G)=\max _{\left|\lambda _{i}\right|