adjacency matrix
Sign in to savesquare matrix used to represent a graph or network
Wikidata facts
- Subclass of
- square matrix
- Image
- Exemple reseaux.png
- Has use
- graph
Show 3 more facts
- Commons category
- Adjacency matrices of graphs
- maintained by WikiProject
- WikiProject Mathematics
- studied by
- graph theory
via Wikidata · CC0
~12 min read
Encyclopedic overview
In graph theory and computer science, an adjacency matrix is a square matrix used to represent a finite graph. The elements of the matrix indicate whether pairs of vertices are adjacent or not within the graph.
In the special case of a finite simple graph, the adjacency matrix is a (0,1)-matrix with zeros on its diagonal. If the graph is undirected (i.e. all of its edges are bidirectional), the adjacency matrix is symmetric. The relationship between a graph and the eigenvalues and eigenvectors of its adjacency matrix is studied in spectral graph theory.
Excerpted from Wikipedia’s “adjacency matrix” article, available under the CC BY-SA 4.0 licence.