Graph theory MOC

Adjacency matrix

Let be a general graph (which may be the underlying graph of a quiver). Given two vertices , the adjacency number is the number of arcs .¹ If the vertices are enumerated , then these may be collected in an adjacency matrix where graph

---

develop | en | sembr

Footnotes

1. Thinking of as a multiset with characteristic function , this is just . The notation is preferred since it gives a uniform treatment to quivers and their underlying graphs. ↩