File:Period-3-graph.svg
Summary
| Description |
English: A strongly-connected graph in which all cycle lengths are divisible by three. Therefore, this graph is not aperiodic. |
| Date | |
| Source | Transferred from en.wikipedia to Commons. |
| Author | David Eppstein at English Wikipedia |
Licensing
 |
This work has been released into the public domain by its author, David Eppstein at English Wikipedia. This applies worldwide. In some countries this may not be legally possible; if so: David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
Original upload log
The original description page was here. All following user names refer to en.wikipedia.
- 2006-10-16 00:47 David Eppstein 265×231×8 (4413 bytes) A strongly-connected graph in which all cycle lengths are divisible by three. Therefore, this graph is not [[Aperiodic graph|aperiodic]].