On \(k\)-partitioning of Hamming graphs (Q1302152): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Sergei L. Bezrukov / rank | |||
Property / author | |||
Property / author: Robert Elsässer / rank | |||
Property / reviewed by | |||
Property / reviewed by: Fedor V. Fomin / rank | |||
Revision as of 14:59, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On \(k\)-partitioning of Hamming graphs |
scientific article |
Statements
On \(k\)-partitioning of Hamming graphs (English)
0 references
9 April 2000
0 references
For a graph \(G=(V,E)\) a \(k\)-partition is a partition \(A=\{A_1, A_2, \dots, A_k \}\) of \(V\) such that \(||A_i|- |A_j||\leq 1\) for all \(i,j\in \{1,2,\dots, k\}\). A cut of partition \(A\) is a set of edges having ends in different sets of the partition. The authors investigate the problem of determining \(k\)-partitions with minimal cardinality cut. Several interesting bounds and asymptotic results for some specific values of \(k\) are presented for Hamming graphs (Cartesian products of complete graphs).
0 references
graph partitioning
0 references
edge-isoperimetric problem
0 references
Hamming graphs
0 references
hypercubes
0 references