context | nv,me∈N |
definiendum | M∈it(nv,me) |
postulate | Matrix(nv,me,{0,1,2}) |
for all | i∈range(nv) |
postulate | ∑mej=1Mij=2 |
The index i in Mij labels the vertices and the index j labels the edges. The definition says that every edge has exactly two endpoints.
Every incidence matrix corresponds to (a representative of the isomorphism class of) a finite undirected graph.