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

Asymptotic Determination of Edge-Bandwidth of Multidimensional Grids and Hamming Graphs

โœ Scribed by Akhtar, Reza; Jiang, Tao; Miller, Zevi

Book ID
118196948
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
306 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Edge-bandwidth of grids and tori
Edge-bandwidth of grids and tori
โœ Oleg Pikhurko; Jerzy Wojciechowski ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 197 KB
Edge-Bandwidth of Graphs
Edge-Bandwidth of Graphs
โœ Jiang, Tao; Mubayi, Dhruv; Shastri, Aditya; West, Douglas B. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 288 KB
The edge-bandwidth of theta graphs
The edge-bandwidth of theta graphs
โœ Dennis Eichhorn; Dhruv Mubayi; Kevin O'Bryant; Douglas B. West ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 129 KB

An edge-labeling f of a graph G is an injection from E(G) to the set of integers. The edge-bandwidth of G is B H (G) min f {B H (f )}, where B H (f ) is the maximum difference between labels of incident edges of G. The theta graph ร‚(l 1 , F F F ,l m ) is the graph consisting of m pairwise internally

Bandwidth edge counts for linear arrange
Bandwidth edge counts for linear arrangements of rectangular grids
โœ Fishburn, Peter; Wright, Paul ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 190 KB

Let G n,m denote a graph with nm vertices arranged in n rows and m โ‰ฅ max{n, 2} columns with an edge {u, v} between vertices u and v if they are adjacent horizontally or vertically. The bandwidth of G n,m is known to equal n. We prove that the number of edges in a bandwidth-achieving linear arrangeme