ON THE BANDWIDTH OF TRIANGULATED TRIANGLES

被引:21
作者
HOCHBERG, R
MCDIARMID, C
SAKS, M
机构
[1] RUTGERS STATE UNIV,DEPT MATH,PISCATAWAY,NJ 08854
[2] UNIV OXFORD,DEPT STAT,OXFORD OX1 3TG,ENGLAND
基金
美国国家科学基金会;
关键词
D O I
10.1016/0012-365X(94)00208-Z
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We give a technique for obtaining a lower bound on the bandwidth of any planar graph with an embedding in which all bounded faces are triangles. This technique is applied to show that, for each positive integer l, the triangulated triangle T-l with side-length l has bandwidth exactly l + 1. This settles a question of Douglas West,
引用
收藏
页码:261 / 265
页数:5
相关论文
共 5 条
[1]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[2]   OPTIMAL LABELING OF A PRODUCT OF 2 PATHS [J].
CHVATALOVA, J .
DISCRETE MATHEMATICS, 1975, 11 (3-4) :249-253
[3]  
FAIGLE U, 1990, GRAPH THEORETIC CONC
[4]  
HARPER LH, 1966, J COMB THEORY, P385
[5]  
LINIAL N, 1991, 2ND P ACM SIAM S DIS, P320