adjacency matrix


Also found in: Wikipedia.

adjacency matrix

[ə′jās·ən·sē ‚mā·triks]
(mathematics)
For a graph with n Vertices, the n × n matrix A = aij, where the nondiagonal entry aij is the number of edges joining vertex i and Vertex j, and the diagonal entry aii is twice the number of loops at vertex i.
For a diagraph with no loops and not more than one are joining any two Vertices, an n × n matrix A = [aij ], in which aij = 1 if there is an are directed from vertex i to vertex j, and otherwise aij = 0.
References in periodicals archive ?
The following measures are calculated[16] with absolute values of the NCM adjacency matrix [17]:
k] describes the adjacency matrix for relationship k.
The experimental results demonstrate the great advantage of our features relative to those of the rich model (RM), the subtractive pixel adjacency model (SPAM) and subtractive prediction error adjacency matrix (SPEAM), especially for compressed videos, which constitute most Internet videos.
Matrix generation helps in identifying the hidden frames and adjacency matrix helps in finding the significant frames in the video.
The sum of all entries in the adjacency matrix is, of course, the total number of edges in the digraph.
Lou and Hong [19] have considered the distributed surrounding of a convex target set by a group of agents with switching communication graphs and proposed a distributed controller to make the agents surround a given set with equal distance and the desired projection angles specified by a complex-value adjacency matrix.
A vector of initial state of variables is multiplied with the adjacency matrix of cognitive map and the results are transformed to the (0, 1) interval using a logistic function.
The aim of this work is to substantiate the problem solubility for project operation structural schemes analysis using analytical method based on consideration of specific properties of adjacency matrix.
The graph whose adjacency matrix is the image matrix is called image graph.
The adjacency matrix A(G) = [aij ]nn(usually denoted by A ) of the graph G is defined as: