The Bandwidth of a Flowerette
Yvette Fajardo-Lim · Journal of Research in Science Computing and Engineering · 2010
A flowerette is a graph which consists of the vertices of the cycle C n together with copies of these vertices joined to each adjoining neighbor of the vertices of C n . The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. This paper establishes the bandwidth of a flowerette for all possible values of n .