Timeline for What is the n-th power of the adjacency matrix equal to?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 21, 2020 at 11:14 | comment | added | smci | @QiaochuYuan: more simply stated: "A path can never reviist the same node, but a walk can"". (Corollary: paths are finite (on a finite graph), but walks can be infinite). Also, I believe these definitions are near-universal. | |
| May 16, 2011 at 8:29 | comment | added | adamo | @Qiaochu Yuan: Yes | |
| May 16, 2011 at 8:19 | comment | added | Qiaochu Yuan | My guess is that a walk is a sequence of vertices connected by edges and a path is a sequence of distinct vertices connected by edges. | |
| May 16, 2011 at 8:13 | history | answered | P.H. | CC BY-SA 3.0 |