Metraipolis › archive › dc_ee02630b8fab

Biconnected graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Biconnected_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T23:09:21.891Z
SHA-256 of the archived text
e28e05be5091c1ba62fb902c7e38e96eba0921d1063a360a80070e75b573bac4
Stable URL of this page
https://metraipolis.com/documento/dc_ee02630b8fab

How to cite

Biconnected graph — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Biconnected_graph (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_ee02630b8fab (Metraipolis archive dc_ee02630b8fab, sha256 e28e05be5091c1ba62fb902c7e38e96eba0921d1063a360a80070e75b573bac4)
BibTeX
@misc{dcee02630b8fab,
  title = {Biconnected graph — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Biconnected_graph},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_ee02630b8fab; sha256 e28e05be5091c1ba62fb902c7e38e96eba0921d1063a360a80070e75b573bac4},
  year = {2026}
}

Archived text

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

In graph theory, a biconnected graph is a connected and "nonseparable" graph, meaning that if any one vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices. The property of being 2-connected is equivalent to biconnectivity, except that the complete graph of two vertices is usually not regarded as 2-connected. This property is especially useful in maintaining a graph with a two-fold redundancy, to prevent disconnection upon the removal of a single edge (or connection). The use of biconnected graphs is very important in the field of networking (see Network flow), because of this property of redundancy.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Biconnected graph» — https://en.wikipedia.org/wiki/Biconnected_graph
Wikidata Q4390447: «graph on at least 3 vertices that remains connected when any one vertex is removed» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q4390447
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Biconnected_graph?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 1265783816, consultata il 2026-10-07T22:47:33.196Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 12455031f5150a9839f01d8ef4437b811e02d79c7242ae5d58ebd31eea7318b0