Combinatorics Spectral and algebraic graph theory Concept
Adjacency matrix
Summary
The adjacency matrix of a finite graph records adjacency as a matrix of zeros and ones. It lets linear algebra study graphs, for example through eigenvalues and powers that count walks. The node adjacency matrix gives the precise definition.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 08B9CX109G |
|---|---|
| URI | m2://08B9CX109G |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C50 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.