Department of Mathematics, Hong Kong Institute of Education, Tai Po, Hong Kong, e-mail: kkpoon@ied.edu.hk
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.
Keywords: graphs, bandwidth, interior boundary, exterior boundary
Classification (MSC 2000): 05C78
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade.
To activate your access, please contact Myris Trade at myris@myris.cz.
Subscribers of Springer (formerly Kluwer) need to access the articles on their site, which is http://www.springeronline.com/10587.