adjacency matrix
Sign in to savesquare matrix used to represent a graph or network
Wikidata facts
- Image
- Exemple reseaux.png
Show 1 more fact
- Commons category
- Adjacency matrices of graphs
via Wikidata · CC0
~12 min read
Article
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.
Connections
eigenvectors and eigenvalues
Entity
block matrix
Entity
graph
Entity
trace
Entity
invertible matrix
Entity
matrix multiplication
Entity
sparse matrix
Entity
logical matrix
Entity
glossary of graph theory terms
Entity
band matrix
Entity
unimodular matrix
Entity
definite matrix
Entity
statistics
Entity
computer science
Entity
International Standard Book Number
Entity
Python
Entity
real number
Entity
digital object identifier
Entity
matrix
Entity
International Standard Serial Number
Entity