Alpha centrality replaces the adjacency matrix with its resolvent. The characteristic polynomial of a graph is the characteristic polynomial of its adjacency matrix. Subgraph centrality replaces the adjacency matrix with its trace. However it is actually the Kronecker tensor product of the adjacency matrices of the graphs. The Seidel adjacency matrix is a -"adjacency matrix". Triangulation algorithm; and the powers of the Adjacency Matrix. Thus a graph must be sparse enough to justify an adjacency list representation. Then each processor gets a submatrix of the adjacency matrix of dimension formula 10. A static DSM is equivalent to an "N" chart or an adjacency matrix. This can be understood as a row-wise or column-wise decomposition of the adjacency matrix. Let "A" be the adjacency matrix of a graph. However, they uses containment rather than adjacency to represent the hierarchy. The neighbor relationship table is called an "adjacency database". Layered "icicle" diagrams that use alignment/adjacency. The adjacency of water gives a number of distinctive characteristics to littoral regions.