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 is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. The Macmillan, London, 1976.
P.Z. Chinn, L. Chvatalova, A.C. Dewdney and N.G. Gibbs. The Bandwidth Problem for Graphs and Matrices-survey.J. Graph Theory, 1982, 6(3): 223–254.
M.R. Garey and P.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman, San Franciso, 1979.
L.H. Harper. Optimal Assignment of Numbers to Vertices.J. SIAM, 1964, 12: 131–135.
Author information
Authors and Affiliations
Additional information
This research is supported by the National Natural Science Foundation of China.
Rights and permissions
About this article
Cite this article
Yao, B., Wang, J. On bandwidth sums of graphs. Acta Mathematicae Applicatae Sinica 11, 69–78 (1995). https://doi.org/10.1007/BF02012624
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02012624