Metraipolis › archive › dc_0dbdac71dc81

Asymmetric graph — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Asymmetric_graph
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-10T05:38:37.888Z
SHA-256 of the archived text
e914e41c44aff6f22480a08ea6869166ed8f70359586cb5e1e70fbed7cc46731
Stable URL of this page
https://metraipolis.com/documento/dc_0dbdac71dc81

How to cite

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

Archived text

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

In graph theory, a branch of mathematics, an undirected graph is called an asymmetric graph if it has no nontrivial symmetries. Formally, an automorphism of a graph is a permutation p of its vertices with the property that any two vertices u and v are adjacent if and only if p(u) and p(v) are adjacent. The identity mapping of a graph is always an automorphism, and is called the trivial automorphism of the graph. An asymmetric graph is a graph for which there are no other automorphisms. Note that the term "asymmetric graph" is not a negation of the term "symmetric graph," as the latter refers to a stronger condition than possessing nontrivial symmetries.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Asymmetric graph» — https://en.wikipedia.org/wiki/Asymmetric_graph
Wikidata Q3034855: «node-link graph without nontrivial symmetries» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3034855
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Asymmetric_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 1251673484, consultata il 2026-11-10T05:35:36.214Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 0ff69f141288f7d1183a0558a209b093ce46c9cbb5ca4d1292b2ef8a5d71c05b