ON HARPERS' RESULT CONCERNING THE BANDWIDTHS OF GRAPHS


    loading  Checking for direct PDF access through Ovid

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.

    loading  Loading Related Articles