Jump to content

File:Period-3-graph.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 283 × 250 pixels, file size: 4 KB)

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

Public domain 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]].

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

16 October 2006

File history

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

Date/TimeThumbnailDimensionsUserComment
current06:11, 13 August 2007Thumbnail for version as of 06:11, 13 August 2007283 × 250 (4 KB)David Eppstein{{Information |Description=A strongly-connected graph in which all cycle lengths are divisible by three. Therefore, this graph is not aperiodic. |Source=Originally from [http://en.wikipedia.org en.wikipedia]; description page is/wa

The following page uses this file:

Global file usage

The following other wikis use this file: