Image:Period-3-graph.png

From Wikipedia, the free encyclopedia

[edit] Summary

A strongly-connected graph in which all cycle lengths are divisible by three. Therefore, this graph is not aperiodic.

[edit] Licensing

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current00:47, 16 October 2006265×231 (4 KB)David Eppstein (Talk | contribs) (A strongly-connected graph in which all cycle lengths are divisible by three. Therefore, this graph is not aperiodic.)

No pages on the English Wikipedia link to this file. (Pages on other projects are not counted.)