ON BANDWIDTH SUMS OF GRAPHS  

作　　者：姚兵 王建方 

出　　处：《Acta Mathematicae Applicatae Sinica》1995年第1期69-78,共10页应用数学学报（英文版）

摘　　要：For a graph G=(V,E) of order p, a 1-1 mapping f:V→{1,2,…,P) is called a labelling of G.Bsum(G)=minf{Σ(u,v)∈E|f(u)-f(v)|:f is a labellied of G} is called the bandwidth sum of G.In this paper, some lower bounds and upper bounds of bandwidth sums of graphs are given.For a graph G=(V,E) of order p, a 1-1 mapping f:V→{1,2,…,P) is called a labelling of G.Bsum(G)=minf{Σ(u,v)∈E|f(u)-f(v)|:f is a labellied of G} is called the bandwidth sum of G.In this paper, some lower bounds and upper bounds of bandwidth sums of graphs are given.

关 键 词：Bandwidth sum of a graph 

分 类 号：O157.5[理学—数学]