ScienceDirect - Discrete Applied Mathematics : On k-partitioning of Hamming graphs*1

Discrete Applied Mathematics
Volume 95, Issues 1-3, 30 July 1999, Pages 127-140

Font Size:

Abstract - selected

Article

Purchase PDF (177 K)

E-mail Article

Add to my Quick Links

Bookmark and share in 2collab (opens in new window)

Request permission to reuse this article

Cited By in Scopus (1)

Related Articles in ScienceDirect

The treewidth and pathwidth of hypercubes
Discrete Mathematics

Recognizing Hamming graphs in linear time and space
Information Processing Letters

On the canonical metric representation, average distanc...
European Journal of Combinatorics

Distance monotonicity and a new characterization of Ham...
Information Processing Letters

The retracts of Hamming graphs
Discrete Mathematics

View More Related Articles

View Record in Scopus

doi:10.1016/S0166-218X(99)00070-0

On k-partitioning of Hamming graphs ^*1

S. L. Bezrukov ^,^,^a, R. Elsässer^b and U. -P. Schroeder^b

^a Department of Mathematics and Computer Science, University of Wisconsin - Superior, Superior, WI 54880-4500, USA ^b Department of Mathematics and Computer Science, University of Paderborn, D-33102 Paderborn, Germany

Received 5 December 1997;

revised 20 May 1998;

accepted 23 December 1998.

Available online 18 November 1999.

References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

We consider the graphs H_aⁿ defined as the Cartesian products of n complete graphs with a vertices each. Let an edge cut partition the vertex set of a graph into k subsets A₁,…,A_k with ||A_i|−|A_j|| less-than-or-equals, slant 1. We consider the problem of determining the minimal size of such a cut for the graphs defined above and present bounds and asymptotic results for some specific values of k.

Author Keywords: Graph partitioning; Edge-isoperimetric problem; Hamming graphs; Hypercubes

*1 This work was partially supported by the German Research Association (DFG) within the SFB 376 “Massive Parallelität: Algorithmen, Entwurfsmethoden, Anwendungen” and by the EC ESPRIT Long Term Research Project 20244 “ALCOM-IT”.

Corresponding author; email: sb@math.uwsuper.edu

Discrete Applied Mathematics
Volume 95, Issues 1-3, 30 July 1999, Pages 127-140

About ScienceDirect | Contact Us | Information for Advertisers | Terms & Conditions | Privacy Policy