Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/on-bandwidth-sums-of-graphs-tlLwut9XDP
References (6)
-
E. Lloyd, J. Bondy, U. Murty (1978)
Graph Theory with Applications -
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,'' -
P. Chinn, J. Chvátalová, A. Dewdney, N. Gibbs (1982)
The bandwidth problem for graphs and matrices - a surveyJ. Graph Theory, 6
-
L.H. Harper (1964)
Optimal Assignment of Numbers to VerticesJ. SIAM, 12
-
L. Harper (1964)
Optimal Assignments of Numbers to VerticesJournal of The Society for Industrial and Applied Mathematics, 12
-
M.R. Garey, P.S. Johnson (1979)
Computers and Intractability: A Guide to the Theory of NP-completeness
- Publisher
- Springer Journals
- Copyright
- Copyright © 1995 by Science Press, Beijing, China and Allerton Press, Inc., New York, U.S.A.
- Subject
- Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
- ISSN
- 0168-9673
- eISSN
- 1618-3932
- DOI
- 10.1007/BF02012624
- Publisher site
- See Article on Publisher Site
Abstract
For a graphG=(V,E) of orderp, a 1−1 mappingf:V→{1,2,...,p} is called a labelling ofG.
Journal
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Jul 14, 2005