Metraipolis › archive › dc_849bfce748c4
Equitable partition — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Equitable_partition
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T16:15:25.781Z
- SHA-256 of the archived text
fba97ec1e2b7a6e7500dcbdbcde5bed47c7aa23ca852778c47c0b5e5cd4fdbbc- Stable URL of this page
https://metraipolis.com/documento/dc_849bfce748c4
How to cite
Equitable partition — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Equitable_partition (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_849bfce748c4 (Metraipolis archive dc_849bfce748c4, sha256 fba97ec1e2b7a6e7500dcbdbcde5bed47c7aa23ca852778c47c0b5e5cd4fdbbc)
BibTeX
@misc{dc849bfce748c4,
title = {Equitable partition — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Equitable_partition},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_849bfce748c4; sha256 fba97ec1e2b7a6e7500dcbdbcde5bed47c7aa23ca852778c47c0b5e5cd4fdbbc},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Equitable_partition. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In graph theory, a branch of mathematics, an equitable partition of the vertex set V of a graph G = (V, E) is a partition of V such that, for any pair of vertices u and v in the same set of the partition and any set B of the partition, both u and v have the same number of neighbors in B. More precisely, one represents V = V 1 ∪ V 2 ∪ ⋯ ∪ V r {\displaystyle V=V_{1}\cup V_{2}\cup \cdots \cup V_{r}} where every vertex is contained in exactly one "cell" V i {\displaystyle V_{i}} , the edges within each cell form a regular graph, and for any two distinct cells V i {\displaystyle V_{i}} and V j {\displaystyle V_{j}} and every vertex v i ∈ V i {\displaystyle v_{i}\in V_{i}} , the number of edges v i v j {\displaystyle v_{i}v_{j}} such that v j ∈ V j {\displaystyle v_{j}\in V_{j}} is a constant b i j {\displaystyle b_{ij}} , independent of the choice of v i ∈ V i {\displaystyle v_{i}\in V_{i}} . The characteristic matrix P {\displaystyle P} of the partition has a row for each vertex and a column for each cell, with 1 in row v {\displaystyle v} and column V i {\displaystyle V_{i}} if v ∈ V i {\displaystyle v\in V_{i}} , otherwise 0. Equitable partitions are important for simplifying calculations involving adjacency and related matrices of large graphs.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Equitable partition» — https://en.wikipedia.org/wiki/Equitable_partition
Wikidata Q139963147 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q139963147
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Equitable_partition?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 1375953871, consultata il 2026-10-15T15:43:35.352Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 1f0a345459c18ec7a329390fb4d2e0c179d173e44b640948999b2f8ce20a5207