Metraipolis › archive › dc_bf05da03c187

Graph labeling — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Graph_labeling
License (as archived): CC-BY-SA-4.0
Archived: 2026-11-07T15:02:36.919Z
SHA-256 of the archived text: 4778756e79b73043938eab1b286e2a435248025fb2eb80daea9bf398986e2f8a
Stable URL of this page: https://metraipolis.com/documento/dc_bf05da03c187

How to cite

Graph labeling — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_labeling (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_bf05da03c187 (Metraipolis archive dc_bf05da03c187, sha256 4778756e79b73043938eab1b286e2a435248025fb2eb80daea9bf398986e2f8a)

BibTeX

@misc{dcbf05da03c187,
  title = {Graph labeling — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Graph_labeling},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_bf05da03c187; sha256 4778756e79b73043938eab1b286e2a435248025fb2eb80daea9bf398986e2f8a},
  year = {2026}
}

Archived text

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

In the mathematical discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally, given a graph G = (V, E), a vertex labeling is a function of V to a set of labels; a graph with such a function defined is called a vertex-labeled graph. Likewise, an edge labeling is a function of E to a set of labels. In this case, the graph is called an edge-labeled graph. When the edge labels are members of an ordered set (e.g., the real numbers), it may be called a weighted graph. When used without qualification, the term labeled graph generally refers to a vertex-labeled graph with all labels distinct. Such a graph may equivalently be labeled by the consecutive integers { 1, …, |V| } , where |V| is the number of vertices in the graph. For many applications, the edges or vertices are given labels that are meaningful in the associated domain. For example, the edges may be assigned weights representing the "cost" of traversing between the incident vertices. In the above definition a graph is understood to be a finite undirected simple graph. However, the notion of labeling may be applied to all extensions and generalizations of graphs. For example, in automata theory and formal language theory it is convenient to consider labeled multigraphs, i.e., a pair of vertices may be connected by several labeled edges.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Graph labeling» — https://en.wikipedia.org/wiki/Graph_labeling
Wikidata Q5597093: «assegnazione di etichette, agli archi o ai vertici (o entrambi) di un grafo» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5597093
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_labeling?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 1375379486, consultata il 2026-11-07T14:58:17.656Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 7f35953da216ba41e0f0aaca06e7ecd1a911f595c0d3d005b38d0375059c1879