# 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*=*a*, where the nondiagonal entry_{ij}*a*is the number of edges joining vertex_{ij}*i*and Vertex*j*, and the diagonal entry*a*is twice the number of loops at vertex_{ii}*i*.For a diagraph with no loops and not more than one are joining any two Vertices, an

*n*×*n*matrix*A*= [*a*], in which_{ij}*a*= 1 if there is an are directed from vertex_{ij}*i*to vertex*j*, and otherwise*a*= 0._{ij}Want to thank TFD for its existence? Tell a friend about us, add a link to this page, or visit the webmaster's page for free fun content.

Link to this page: