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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-6957 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-69572022-06-03T05:36:51Z The bandwidth of tower graphs Tm,2 and Tm,3 Garcia, Mark Anthony A. 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. 2007-08-01T07:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/6070 Faculty Research Work Animo Repository Graph theory Graph labelings Mathematics |
| 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 |
| topic |
Graph theory Graph labelings Mathematics |
| spellingShingle |
Graph theory Graph labelings Mathematics Garcia, Mark Anthony A. The bandwidth of tower graphs Tm,2 and Tm,3 |
| description |
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. |
| format |
text |
| author |
Garcia, Mark Anthony A. |
| author_facet |
Garcia, Mark Anthony A. |
| author_sort |
Garcia, Mark Anthony A. |
| title |
The bandwidth of tower graphs Tm,2 and Tm,3 |
| title_short |
The bandwidth of tower graphs Tm,2 and Tm,3 |
| title_full |
The bandwidth of tower graphs Tm,2 and Tm,3 |
| title_fullStr |
The bandwidth of tower graphs Tm,2 and Tm,3 |
| title_full_unstemmed |
The bandwidth of tower graphs Tm,2 and Tm,3 |
| title_sort |
bandwidth of tower graphs tm,2 and tm,3 |
| publisher |
Animo Repository |
| publishDate |
2007 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/6070 |
| _version_ |
1767196469873344512 |