Periodic graph (graph theory)

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 Fⁿ(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

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

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

[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.

[1]

[2]