释义 |
adjacency matrix For a graph G, with n vertices v1, v2,…, vn, the adjacency matrix A is the n×n matrix [aij] with aij equalling the number of edges connecting vi to vj. The matrix A is symmetric if G is not directed and the sum of any row's (or column's) entries is equal to the degree of the corresponding vertex. An example of a graph and its adjacency matrix A is shown in the figure.
|