On the bandwidth of caterpillars with hairs of length 1 and 2
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 p...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2002
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17199 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-17712 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-177122022-01-25T07:15:49Z On the bandwidth of caterpillars with hairs of length 1 and 2 Arguillo, Ryan De Leon, Leah Lu Lina 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. 2002-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/17199 Bachelor's Theses English Animo Repository |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| description |
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. |
| format |
text |
| author |
Arguillo, Ryan De Leon, Leah Lu Lina |
| spellingShingle |
Arguillo, Ryan De Leon, Leah Lu Lina On the bandwidth of caterpillars with hairs of length 1 and 2 |
| author_facet |
Arguillo, Ryan De Leon, Leah Lu Lina |
| author_sort |
Arguillo, Ryan |
| title |
On the bandwidth of caterpillars with hairs of length 1 and 2 |
| title_short |
On the bandwidth of caterpillars with hairs of length 1 and 2 |
| title_full |
On the bandwidth of caterpillars with hairs of length 1 and 2 |
| title_fullStr |
On the bandwidth of caterpillars with hairs of length 1 and 2 |
| title_full_unstemmed |
On the bandwidth of caterpillars with hairs of length 1 and 2 |
| title_sort |
on the bandwidth of caterpillars with hairs of length 1 and 2 |
| publisher |
Animo Repository |
| publishDate |
2002 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/17199 |
| _version_ |
1772835127089430528 |