On bandwidth sums of graphs |
| |
| Authors: | Bing Yao Jianfang Wang |
| |
| Institution: | (1) Department of Mathematics, Northwestern Normal University, 730070 Lanzhou, China;(2) Institute of Applied Mathematics, the Chinese Academy of Sciences, 100080 Beijing, China |
| |
| Abstract: | For a graphG=(V,E) of orderp, a 1–1 mappingf:V {1,2,...,p} is called a labelling ofG.
B
sum(G)=min
f
{ (u,v) E
|f(u)–f(v)|:f is a labelling ofG} is called the bandwidth sum ofG.In this paper, some lower bounds and upper bounds of bandwidth sums of graphs are given.This research is supported by the National Natural Science Foundation of China. |
| |
| Keywords: | Bandwidth sum of a graph |
| 本文献已被 CNKI SpringerLink 等数据库收录！ |
|
