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 ?
In the twelfth chapter on Graph Generation by Kronecker Multiplication, the authors have provided a brief description to offset the unequal distribution of adjacency matrix followed by a summary in the next chapter.
can be obtained by the diagonal elements of a matrix function f applied to the adjacency matrix A of the network.
Operation matrix is built according to the adjacency matrix.
After determination of the significant connections, the adjacency matrix A was created with elements [a.
We will form the adjacency matrix A one column at a time.
The adjacency matrix A = A(G) is the n x n symmetric matrix whose (i, j) entry is 1 if ij is an edge, 0 otherwise.
The described verification approach is based on using graphs and adjacency matrix.
nxn] is called the weighted adjacency matrix of G with nonnegative elements and [a.
They exploit the duality between the canonical representation of graphs as abstract collections of vertices with edges and a sparse adjacency matrix representation.
In this paper, we consider the adjacency matrix for RC-graphs and the eigen values are taken into account and a handful of results are obtained.
The matrix based on the prey-predator link, a binary relation, is, in fact, the adjacency matrix (defined below) of the digraph associated with a food web.