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 ...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.
