Metraipolis › archive › dc_5fe6e7752dbc

Loop (graph theory) — Wikipedia (en)

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

How to cite

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

Archived text

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

In graph theory, a loop (also called a self-loop or a buckle) is an edge that connects a vertex to itself. A simple graph contains no loops. Depending on the context, a graph or a multigraph may be defined so as to either allow or disallow the presence of loops (often in concert with allowing or disallowing multiple edges between the same vertices): Where graphs are defined so as to allow loops and multiple edges, a graph without loops or multiple edges is often distinguished from other graphs by calling it a simple graph. Where graphs are defined so as to disallow loops and multiple edges, a graph that does have loops or multiple edges is often distinguished from the graphs that satisfy these constraints by calling it a multigraph or pseudograph. In a graph with one vertex, all edges must be loops. Such a graph is called a bouquet.

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