Metraipolis › archive › dc_e7d8dc1bb91f

Cartesian product of graphs — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Cartesian_product_of_graphs
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:43:27.302Z
SHA-256 of the archived text
2ef0b5edb23cc3252640718d2cb7ef1b251e25a92780ca5e36f2c5abb2743fe1
Stable URL of this page
https://metraipolis.com/documento/dc_e7d8dc1bb91f

How to cite

Cartesian product of graphs — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Cartesian_product_of_graphs (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_e7d8dc1bb91f (Metraipolis archive dc_e7d8dc1bb91f, sha256 2ef0b5edb23cc3252640718d2cb7ef1b251e25a92780ca5e36f2c5abb2743fe1)
BibTeX
@misc{dce7d8dc1bb91f,
  title = {Cartesian product of graphs — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Cartesian_product_of_graphs},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_e7d8dc1bb91f; sha256 2ef0b5edb23cc3252640718d2cb7ef1b251e25a92780ca5e36f2c5abb2743fe1},
  year = {2026}
}

Archived text

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

In graph theory, the Cartesian product G □ H of graphs G and H is a graph such that: the vertex set of G □ H is the Cartesian product V(G) × V(H); and two vertices (u,v) and (u' ,v' ) are adjacent in G □ H if and only if either u = u' and v is adjacent to v' in H, or v = v' and u is adjacent to u' in G. The Cartesian product of graphs is sometimes called the box product of graphs. The operation is associative, as the graphs (F □ G) □ H and F □ (G □ H) are naturally isomorphic. The operation is commutative as an operation on isomorphism classes of graphs, and more strongly the graphs G □ H and H □ G are naturally isomorphic, but it is not commutative as an operation on vertex-labeled graphs. The notation G × H has often been used for Cartesian products of graphs, but is now more commonly used for another construction known as the tensor product of graphs. The square symbol is intended to be an intuitive and unambiguous notation for the Cartesian product, since it shows visually the four edges resulting from the Cartesian product of two edges.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «category theory»).
Fonte: Wikipedia in inglese, voce «Cartesian product of graphs» — https://en.wikipedia.org/wiki/Cartesian_product_of_graphs
Wikidata Q3406706 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3406706
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Cartesian_product_of_graphs?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 1338361695, consultata il 2026-10-07T17:13:12.475Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 53e7dab6ec49027e555ec29c0467b3698d90cedde3f5a2639fa891344aa9dd46