Metraipolis › archive › dc_e0b7dc1ebbbe

Graph automorphism — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Graph_automorphism
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:51:46.976Z
SHA-256 of the archived text
b93be2b4b4a7c892a7d2ebf868176c0fd5a5e2ae03bd19269d2a276d04359a08
Stable URL of this page
https://metraipolis.com/documento/dc_e0b7dc1ebbbe

How to cite

Graph automorphism — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Graph_automorphism (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e0b7dc1ebbbe (Metraipolis archive dc_e0b7dc1ebbbe, sha256 b93be2b4b4a7c892a7d2ebf868176c0fd5a5e2ae03bd19269d2a276d04359a08)
BibTeX
@misc{dce0b7dc1ebbbe,
  title = {Graph automorphism — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Graph_automorphism},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e0b7dc1ebbbe; sha256 b93be2b4b4a7c892a7d2ebf868176c0fd5a5e2ae03bd19269d2a276d04359a08},
  year = {2026}
}

Archived text

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

In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity. Formally, an automorphism of a graph G = (V, E) is a permutation σ of the vertex set V, such that the pair of vertices (u, v) form an edge if and only if the pair (σ(u), σ(v)) also form an edge. That is, it is a graph isomorphism from G to itself. Automorphisms may be defined in this way both for directed graphs and for undirected graphs. The composition of two automorphisms is another automorphism, and the set of automorphisms of a given graph, under the composition operation, forms a group, the automorphism group of the graph. In the opposite direction, by Frucht's theorem, all groups can be represented as the automorphism group of a connected graph – indeed, of a cubic graph.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Graph automorphism» — https://en.wikipedia.org/wiki/Graph_automorphism
Wikidata Q834981 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q834981
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Graph_automorphism?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 1343716700, consultata il 2026-10-07T22:26:37.487Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 3ff86cca3a71fda8df84bcc01c6b52eb92206f07dda29b8bee629cad56ff93d3