Metraipolis › archive › dc_a692ede12888

Graph (topology) — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Graph_(topology)
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T12:52:47.117Z
SHA-256 of the archived text
2bd98a73aef19a882edb5d391b6391e226fd39f8322da88972fb4084e7f1dbfa
Stable URL of this page
https://metraipolis.com/documento/dc_a692ede12888

How to cite

Graph (topology) — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_(topology) (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_a692ede12888 (Metraipolis archive dc_a692ede12888, sha256 2bd98a73aef19a882edb5d391b6391e226fd39f8322da88972fb4084e7f1dbfa)
BibTeX
@misc{dca692ede12888,
  title = {Graph (topology) — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Graph_(topology)},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_a692ede12888; sha256 2bd98a73aef19a882edb5d391b6391e226fd39f8322da88972fb4084e7f1dbfa},
  year = {2026}
}

Archived text

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

In topology, a branch of mathematics, a graph is a topological space which arises from a usual graph G = ( E , V ) {\displaystyle G=(E,V)} by replacing vertices by points and each edge e = x y ∈ E {\displaystyle e=xy\in E} by a copy of the unit interval I = [ 0 , 1 ] {\displaystyle I=[0,1]} , where 0 {\displaystyle 0} is identified with the point associated to x {\displaystyle x} and 1 {\displaystyle 1} with the point associated to y {\displaystyle y} . That is, as topological spaces, graphs are exactly the simplicial 1-complexes and also exactly the one-dimensional CW complexes. Thus, in particular, it bears the quotient topology of the set X 0 ⊔ ⨆ e ∈ E I e {\displaystyle X_{0}\sqcup \bigsqcup _{e\in E}I_{e}} under the quotient map used for gluing. Here X 0 {\displaystyle X_{0}} is the 0-skeleton (consisting of one point for each vertex x ∈ V {\displaystyle x\in V} ), I e {\displaystyle I_{e}} are the closed intervals glued to it, one for each edge e ∈ E {\displaystyle e\in E} , and ⊔ {\displaystyle \sqcup } is the disjoint union. The topology on this space is called the graph topology.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «topology»).
Fonte: Wikipedia in inglese, voce «Graph (topology)» — https://en.wikipedia.org/wiki/Graph_(topology)
Wikidata Q30689475: «topological space» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q30689475
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_(topology)?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 1323512647, consultata il 2026-10-06T11:08:50.281Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: beb07076989cc1edd328dab9a726d8405bdb66ce444b75529ad37ca9a1b895f8