On Harpers’ result concerning the bandwidths of graphs
Czechoslovak Mathematical Journal, Tome 54 (2004) no. 2, pp. 401-405
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
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.
@article{CMJ_2004__54_2_a11,
author = {Poon, Kin-Keung},
title = {On {Harpers{\textquoteright}} result concerning the bandwidths of graphs},
journal = {Czechoslovak Mathematical Journal},
pages = {401--405},
publisher = {mathdoc},
volume = {54},
number = {2},
year = {2004},
mrnumber = {2059260},
zbl = {1080.05530},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMJ_2004__54_2_a11/}
}
Poon, Kin-Keung. On Harpers’ result concerning the bandwidths of graphs. Czechoslovak Mathematical Journal, Tome 54 (2004) no. 2, pp. 401-405. http://geodesic.mathdoc.fr/item/CMJ_2004__54_2_a11/