Skip to main content
SpringerLink
Log in

On Harpers' Result Concerning the Bandwidths of Graphs

  • Published:
Czechoslovak Mathematical Journal Aims and scope Submit manuscript

Abstract

In this paper, we improve the result by Harper on the lower bound of the bandwidth of connected graphs. In addition, we prove that considerating the interior boundary and the exterior boundary when estimating the bandwidth of connected graphs gives the same results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. A. Bondy and U. S. R. Murty: Graph Theory with Applications. Macmillan, 1976.

  2. P. Z. Chinn, J. Chvátalová, A. K. Dewdney and N. E. Gibbs: The bandwidth problem for graphs and matrices—a survey. J. Graph Theory 6 (1982), 223-254.

    Google Scholar 

  3. J. Chvátalová and J. Opatrný: The bandwidth problem and operations on graphs. Discrete Math. 61 (1986), 141-150.

    Google Scholar 

  4. F. R. K. Chung: Labelings of Graphs, Selected Topics in Graph Theory, III (L. Beineke, R. Wilson, eds.). Academic Press, New York, 1988, pp. 151-168.

    Google Scholar 

  5. M. R. Garey, R. L. Graham, D. S. Johnson and D. E. Knuth: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978), 477-495.

    Google Scholar 

  6. F. Harary: Problem 16. Theory of Graphs and its Applications. Proc. Symp., Smolenice (M. Fiedler, ed.). Czechoslovak Academy of Sciences, Prague, 1964.

    Google Scholar 

  7. L. H. Harper: Optimal numberings and isoperimetric problems on graphs. J. Combin. Theory 1 (1966), 385-393.

    Google Scholar 

  8. D. J. Kleitman and R.V. Vohra: Computing the bandwidth of interval graphs. SIAM J. Discrete Math. 3 (1990), 373-375.

    Google Scholar 

  9. R. R. Korfhage: Numberings of the vertices of graphs. Computer Science Department Technical Report 5. Purdue University, Lafayette, 1966.

    Google Scholar 

  10. Peter C. B. Lam, W. C. Shiu and Y. Lin: Duality in the bandwidth problems. Congressus Numerantium 124 (1997), 117-127.

    Google Scholar 

  11. M. M. Syslo and J. Zak: The bandwidth problem: Critical subgraphs and the solution for caterpillars. Ann. Discrete Math. 16 (1982), 281-286.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Hong Kong Institute of Education, Tai Po, Hong Kong

    Kin-Keung Poon

Authors
  1. Kin-Keung Poon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Poon, KK. On Harpers' Result Concerning the Bandwidths of Graphs. Czechoslovak Mathematical Journal 54, 401–405 (2004). https://doi.org/10.1023/B:CMAJ.0000042378.90480.b1

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:CMAJ.0000042378.90480.b1

Search

Navigation