𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Harpers' Result Concerning the Bandwidths of Graphs

✍ Scribed by Kin-Keung Poon

Book ID
111577430
Publisher
Springer
Year
2004
Tongue
English
Weight
76 KB
Volume
54
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

πŸ“œ 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 bandwidth of a Hamming graph
On the bandwidth of a Hamming graph
✍ L.H. Harper πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 198 KB

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-channe