**This is an old revision of the document!**

## Adjacency matrix

### Set

$n\in\mathbb N$ |

$ A \in \mathrm{it}(n) $ |

$ A \in \mathrm{SquareMatrix}(n,\mathbb N) $ |

### Discussion

If the indices $i,j$ label two vertices of a finite undirected graph, then the value $A_{ij}$ determines the number of edges joining them.