is a -adjacency matrix. This matrix is used in studying strongly regular graphs and two-graphs.

The distance matrix has in position the distance between vertices and . The distance is the length of a shortest path connecting the vertices. Unless lengths of edges are explicitly provided, the length of a path is the number of edges in it. The distance matrix resembles a high power of the adjacency matrix, but instead