HomeJournal Of Research In Science, Computing And Engineeringvol. 3 no. 2 (2006)

The Bandwidth of a Flowerette

Yvette Fajardo-lim

Discipline: Mathematics



A flowerette is a graph which consists of the vertices of the cycle Cn together with copies of these vertices joined to each adjoining neighbor of the vertices of Cn. 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.