[SeqFan]. Adjacency matrix, correction^2.

[Antti Karttunen]

I wrote:

>
> (And Wikipedia is not any better: 
> http://en.wikipedia.org/wiki/Adjacency_matrix )

As Matthew Conroy kindly corrected me, it _is_ mentioned there, right in 
the properties section:
  "If /A/ is the adjacency matrix of the directed or undirected graph 
/G/, then the matrix /A/^/n/
  (i.e. the matrix product of /n/ copies of /A/) has an interesting 
interpretation: the entry in
  row /i/ and column /j/ gives the number of (directed or undirected) 
paths of length /n/ from
  vertex /i/ to vertex /j/."

My apologies to all Wikipedians.

> But this page explains it: http://mathworld.wolfram.com/GraphPower.html
>
> -- Same.
>
>
>