Jump to content

Periodic graph (graph theory)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by DancingMirrorBall9832 (talk | contribs) at 23:47, 2 July 2014 (link). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In graph theory, a branch of mathematics, a periodic graph with respect to an operator F on graphs is one for which there exists an integer n > 0 such that Fn(G) is isomorphic to G.[1] For example, every graph is periodic with respect to the complementation operator, whereas only complete graphs are periodic with respect to the operator that assigns to each graph the complete graph on the same vertices. Periodicity is one of many properties of graph operators, the central topic in graph dynamics.[2]

References

  1. ^ Zelinka, B. (2001), "Periodicity of graph operators", Discrete Mathematics, 235: 349–351, doi:10.1016/s0012-365x(00)00288-0, retrieved 14 August 2010
  2. ^ Prisner, Erich (1995). Graph Dynamics. CRC Press. ISBN 978-0-582-28696-2.