The bandwidth of tower graphs Tm,2 and Tm,3
The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such that the maximum difference between adjacent vertices is minimized. This thesis is a study on the bandwidth of tower graphs Tm,2 and Tm,3. Furthermore, some theorems and properties of bandwidth-critical...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2007
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/6070 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | The bandwidth problem deals with finding a labeling of a graph G using non-negative integers such that the maximum difference between adjacent vertices is minimized. This thesis is a study on the bandwidth of tower graphs Tm,2 and Tm,3. Furthermore, some theorems and properties of bandwidth-critical subgraphs included in the paper entitled The bandwidth problem: Critical subgraphs and solution for caterpillars by Maciej Syslo and Jerzy Zak were proven and were used in the proofs for the bandwidth of tower graphs Tm,2 and Tm,3. |
|---|