Adjacency Matrix Let G=(V,E) be a graph with n vertices. The adjacency matrix of G is a two-dimensional n by n array, say adj_mat.
{"Image DocumentName": "Adjacency MatrixLet G=(V,E) be a graph with n vertices. The adjacency matrix of G is a two-dimensional n by n array, say adj_mat.", "Image ImageDescription": "If the edge (vi, vj) is in E(G), adj_mat[i][j]=1. If there is no such edge in E(G), adj_mat[i][j]=0. The adjacency matrix for an undirected graph is symmetric; the adjacency matrix for a digraph need not be symmetric. Merits of adjacency matrix. To determine the connection of vertices is easy. The degree of a vertex is. For a digraph, the row sum is the out_degree, while the column sum is the in_degree. Drawback of adjacency matrix. for sparse graph, most of terms in the adjacency matrix equal zero.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}