Metraipolis › archive › dc_30ea1ed5927d

Aperiodic graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Aperiodic_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-09T16:41:55.942Z
SHA-256 of the archived text
463bb920535e1ca8d13e003157b8f75502d2b08e9eec72ae20a95b7938d21b0c
Stable URL of this page
https://metraipolis.com/documento/dc_30ea1ed5927d

How to cite

Aperiodic graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Aperiodic_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_30ea1ed5927d (Metraipolis archive dc_30ea1ed5927d, sha256 463bb920535e1ca8d13e003157b8f75502d2b08e9eec72ae20a95b7938d21b0c)
BibTeX
@misc{dc30ea1ed5927d,
  title = {Aperiodic graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Aperiodic_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_30ea1ed5927d; sha256 463bb920535e1ca8d13e003157b8f75502d2b08e9eec72ae20a95b7938d21b0c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Aperiodic_graph. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph G is called the period of G.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Aperiodic graph» — https://en.wikipedia.org/wiki/Aperiodic_graph
Wikidata Q4779368: «directed graph with no integer k > 1 that divides the length of every cycle» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4779368
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Aperiodic_graph?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1319831780, consultata il 2026-11-09T16:38:40.384Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 087d207c909919fb4d2641ba9e4f658d7a552316b59d42ddc0b7644cfc0e1841