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 |