Matrix graph
= Matrix graph
For a symmetric <sparse matrix>, its <matrix graph> has one vertex per unknown and an edge $i-j$ whenever the off-diagonal entry $a_{ij}$ is structurally nonzero. Simultaneous row and column permutation relabels this <graph>. Nonsymmetric patterns are instead represented by directed or bipartite <graphs> when row and column roles must be distinguished.