On Harpers’ result concerning the bandwidths of graphs

Kin-Keung Poon

Czechoslovak Mathematical Journal (2004)

  • Volume: 54, Issue: 2, page 401-405
  • ISSN: 0011-4642

Abstract

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

How to cite

top

Poon, Kin-Keung. "On Harpers’ result concerning the bandwidths of graphs." Czechoslovak Mathematical Journal 54.2 (2004): 401-405. <http://eudml.org/doc/30869>.

@article{Poon2004,
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.},
author = {Poon, Kin-Keung},
journal = {Czechoslovak Mathematical Journal},
keywords = {graphs; bandwidth; interior boundary; exterior boundary; graphs; bandwidth; interior boundary; exterior boundary},
language = {eng},
number = {2},
pages = {401-405},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On Harpers’ result concerning the bandwidths of graphs},
url = {http://eudml.org/doc/30869},
volume = {54},
year = {2004},
}

TY - JOUR
AU - Poon, Kin-Keung
TI - On Harpers’ result concerning the bandwidths of graphs
JO - Czechoslovak Mathematical Journal
PY - 2004
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 54
IS - 2
SP - 401
EP - 405
AB - 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.
LA - eng
KW - graphs; bandwidth; interior boundary; exterior boundary; graphs; bandwidth; interior boundary; exterior boundary
UR - http://eudml.org/doc/30869
ER -

References

top
  1. Graph Theory with Applications, Macmillan, 1976. (1976) MR0411988
  2. 10.1002/jgt.3190060302, J.  Graph Theory 6 (1982), 223–254. (1982) MR0666794DOI10.1002/jgt.3190060302
  3. 10.1016/0012-365X(86)90086-5, Discrete Math. 61 (1986), 141–150. (1986) MR0855320DOI10.1016/0012-365X(86)90086-5
  4. Labelings of Graphs, Selected Topics in Graph Theory,  III, L.  Beineke, R.  Wilson (eds.), Academic Press, New York, 1988, pp. 151–168. (1988) MR1205400
  5. 10.1137/0134037, SIAM J.  Appl. Math. 34 (1978), 477–495. (1978) MR0478746DOI10.1137/0134037
  6. Problem 16, Theory of Graphs and its Applications. Proc. Symp., Smolenice, M. Fiedler (ed.), Czechoslovak Academy of Sciences, Prague, 1964. (1964) MR0175111
  7. 10.1016/S0021-9800(66)80059-5, J.  Combin. Theory 1 (1966), 385–393. (1966) Zbl0158.20802MR0200192DOI10.1016/S0021-9800(66)80059-5
  8. 10.1137/0403033, SIAM J.  Discrete Math. 3 (1990), 373–375. (1990) MR1061978DOI10.1137/0403033
  9. Numberings of the vertices of graphs, Computer Science Department Technical Report  5, Purdue University, Lafayette, 1966. (1966) 
  10. Duality in the bandwidth problems, Congressus Numerantium 124 (1997), 117–127. (1997) MR1605101
  11. The bandwidth problem: Critical subgraphs and the solution for caterpillars, Ann. Discrete Math. 16 (1982), 281–286. (1982) MR0686313

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.