# Differences

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | Next revision Both sides next revision | ||

adjacency_matrix [2014/02/13 16:13] 127.0.0.1 external edit |
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}\frac{1}{3}\mathrm{tr}\,A^3$ is the number of triangles in the graph. | ||

==== Parents ==== | ==== Parents ==== | ||

=== Subset of === | === Subset of === |