Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
adjacency_matrix [2014/02/10 11:56] nikolaj |
adjacency_matrix [2014/02/14 13:41] nikolaj |
||
|---|---|---|---|
| Line 9: | Line 9: | ||
| ==== Discussion ==== | ==== 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. | 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. | ||
| + | === Theorems === | ||
| + | The number $(A^n)_{ij}$ is the number of paths from $v_i$ to $v_j$. And so, for example, $\frac{1}{2}\cdot\frac{1}{3}\cdot\mathrm{tr}\,A^3$ is the number of triangles in the graph. | ||
| ==== Parents ==== | ==== Parents ==== | ||
| === Subset of === | === Subset of === | ||
| [[Hermitian matrix]] | [[Hermitian matrix]] | ||
| === Related === | === Related === | ||
| - | [[Undirected graph]] | + | [[Finite undirected graph]] |
