๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the bandwidth of a Hamming graph

โœ Scribed by L.H. Harper

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
198 KB
Volume
301
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

โœฆ Synopsis

The bandwidth of the Hamming graph (the product, (Kn) d , of complete graphs) has been an open question for many years. Recently Berger-Wolf and Rheingold [1] pointed out that the bandwidth of a numbering of the Hamming graph may be interpreted as a measure of the e ects of noise in the multi-channel transmission of data with that numbering. They also gave lower and upper bounds for it. In this paper we present better lower and upper bounds, showing that the bandwidth of (Kn) d is asymptotic to (2= d)n d as d โ†’ โˆž.

๐Ÿ“œ SIMILAR VOLUMES

On bandwidth sums of graphs
On bandwidth sums of graphs
โœ Bing Yao; Jianfang Wang ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Institute of Applied Mathematics, Chinese Academy ๐ŸŒ English โš– 395 KB
On the size of graphs of a given bandwid
On the size of graphs of a given bandwidth
โœ Ronald D. Dutton; Robert C. Brigham ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 489 KB

The relationship between the graphical invariants bandwidth and number of edges is considered. Bounds, some sharp and others improvements of known results, are given for the nznber of edges of graphs having a given bandwidth. An important invariant of undirected graphs having no loops or multiple e

The number of edges in a subgraph of a H
The number of edges in a subgraph of a Hamming graph
โœ R. Squier; B. Torrence; A. Vogt ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 363 KB

G be a subgraph of the Cartesian product Hamming graph (Kp)r with n vertices. Then the number of edges of G is at most (1/2)(p -1) log, n, with equality holding if and only G is isomorphic to (Kp)s for some s 5 r.