On the bandwidth of caterpillars with hairs of length 1 and 2
Date of Publication
2002
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
The Bandwidth problem for a graph seeks to find a labeling for the vertices of a graph G with nonnegative integers such that the maximum difference between any pair of vertices is minimized. In this study, an algorithm for finding the a labeling of caterpillars with hairs of length 1 and 2 will be presented. The algorithm will also be used to show that the bandwidth of any caterpillar with hairs of length 1 and 2 is given by its local density.
Abstract Format
html
Language
English
Format
Accession Number
TU10901
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
80 numb. leaves
Recommended Citation
Arguillo, R., & De Leon, L. (2002). On the bandwidth of caterpillars with hairs of length 1 and 2. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17199
