ISSN:
1618-3932
Keywords:
Bandwidth sum of a graph
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02012624