Metraipolis › archive › dc_dbb25420faed

Degree (graph theory) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Degree_(graph_theory)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T11:32:48.582Z
SHA-256 of the archived text
14f5fc90e143cafe478a5a47f8e86b9ffecb3f070e4f1b4f3c7e89dd135dba24
Stable URL of this page
https://metraipolis.com/documento/dc_dbb25420faed

How to cite

Degree (graph theory) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Degree_(graph_theory) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_dbb25420faed (Metraipolis archive dc_dbb25420faed, sha256 14f5fc90e143cafe478a5a47f8e86b9ffecb3f070e4f1b4f3c7e89dd135dba24)
BibTeX
@misc{dcdbb25420faed,
  title = {Degree (graph theory) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Degree_(graph_theory)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_dbb25420faed; sha256 14f5fc90e143cafe478a5a47f8e86b9ffecb3f070e4f1b4f3c7e89dd135dba24},
  year = {2026}
}

Archived text

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

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes 2 to a vertex's degree, for the two ends of the edge. The degree of a vertex v {\displaystyle v} is denoted deg ( v ) {\displaystyle \deg(v)} or deg v {\displaystyle \deg v} . The maximum degree of a graph G {\displaystyle G} is denoted by Δ ( G ) {\displaystyle \Delta (G)} , and is the maximum of G {\displaystyle G} 's vertices' degrees. The minimum degree of a graph is denoted by δ ( G ) {\displaystyle \delta (G)} , and is the minimum of G {\displaystyle G} 's vertices' degrees. In the multigraph shown on the right, the maximum degree is 5 and the minimum degree is 0. In a regular graph, every vertex has the same degree, and so we can speak of the degree of the graph. A complete graph (denoted K n {\displaystyle K_{n}} , where n {\displaystyle n} is the number of vertices in the graph) is a special kind of regular graph where all vertices have the maximum possible degree, n − 1 {\displaystyle n-1} . In a signed graph, the number of positive edges connected to a vertex is called its positive degree and the number of connected negative edges is called negative degree.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Graph theory»).
Fonte: Wikipedia in inglese, voce «Degree (graph theory)» — https://en.wikipedia.org/wiki/Degree_(graph_theory)
Wikidata Q383444: «number of edges incident to a given vertex in a node-link graph» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q383444
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Degree_(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 1339300235, consultata il 2026-10-06T09:55:39.866Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: dafb8299a506f63084015549b3ccf39d2f85838e81b241d8a58ccdf2b87187bb