Metraipolis › archive › dc_893ee6d84f9c

Cycle (graph theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Cycle_(graph_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-15T14:34:05.762Z
SHA-256 of the archived text
d99e7a538ee7378ebf44cf6d11ef323d3eb9d628830d2bf3e419fea7998b888d
Stable URL of this page
https://metraipolis.com/documento/dc_893ee6d84f9c

How to cite

Cycle (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Cycle_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_893ee6d84f9c (Metraipolis archive dc_893ee6d84f9c, sha256 d99e7a538ee7378ebf44cf6d11ef323d3eb9d628830d2bf3e419fea7998b888d)
BibTeX
@misc{dc893ee6d84f9c,
  title = {Cycle (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Cycle_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_893ee6d84f9c; sha256 d99e7a538ee7378ebf44cf6d11ef323d3eb9d628830d2bf3e419fea7998b888d},
  year = {2026}
}

Archived text

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

In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is a non-empty directed trail in which only the first and last vertices are equal. A graph without cycles is called an acyclic graph (or a forest). A directed graph without directed cycles is called a directed acyclic graph. A connected graph without cycles is called a tree.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Cycle (graph theory)» — https://en.wikipedia.org/wiki/Cycle_(graph_theory)
Wikidata Q245595 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q245595
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Cycle_(graph_theory)?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 1372590600, consultata il 2026-10-15T13:56:59.557Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: d1da6d13f518c643798442f5b5b46db0ff96333fcb9fccb66934d99ef678d68b