Combinatorics Spectral and algebraic graph theory Concept
Incidence matrix
Summary
The incidence matrix of a graph records which vertices lie on which edges. It has a row for each vertex, a column for each edge, and a nonzero entry where the vertex is an end of the edge. In the oriented version the two ends get opposite signs, and the product of the matrix with its transpose is the Laplacian matrix. More generally, an incidence matrix describes any incidence relation between two finite sets, such as points and blocks of a design.
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | 9DNFN8M83X |
|---|---|
| URI | m2://9DNFN8M83X |
| Kind | concept |
| Writing | W0 stub |
| MSC | 05C50 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.