Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

COMBINATORICS
2007

favoriteEmaildiscussreport

48views more COMBINATORICS 2007»

Edge-Bandwidth of the Triangular Grid

13 years 5 months ago

Edge-Bandwidth of the Triangular Grid

Download www3.combinatorics.org

In 1995, Hochberg, McDiarmid, and Saks proved that the vertex-bandwidth of the triangular grid Tn is precisely n + 1; more recently Balogh, Mubayi, and Pluh´ar posed the problem of determining the edge-bandwidth of Tn. We show that the edge-bandwidth of Tn is bounded above by 3n − 1 and below by 3n − o(n).

Reza Akhtar, Tao Jiang, Dan Pritikin

Real-time Traffic

COMBINATORICS 2007 | Grid | McDiarmid | Triangular Grid Tn |

claim paper

Related Content

» Exploring Simple Triangular and Hexagonal Grid Polygons Online

» Asymptotic Determination of EdgeBandwidth of Multidimensional Grids and Hamming Graphs

» Hamiltonian Cycles in Triangular Grids

» Hamiltonian properties of triangular grid graphs

» Fast analysis of structured power grid by triangularization based structure preserving mod...

» A Parallel Adaptive Refinement Scheme for Tetrahedral and Triangular Grids

» SelfAvoiding Walks over Adaptive Unstructured Grids

» Fast IntersectionFree Offset Surface Generation From Freeform Models With Triangular Meshe...

» On the Fractal Dimension of Isosurfaces

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Reza Akhtar, Tao Jiang, Dan Pritikin

Comments (0)