On \(k\)-partitioning of Hamming graphs (Q1302152): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(99)00070-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2037594260 / rank | |||
Normal rank |
Revision as of 09:23, 30 July 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