The bandwidth of the tower graph Tm,n
The bandwidth problem for a graph is that of labeling its vertices with distinct integers so that the maximum difference across an edge is minimized. In this study, the bandwidth of a tower graph Tm,n is investigated. A tower graph Tm,n is a block graph such that the following are satisfied: 1. the...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2009
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/6069 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | The bandwidth problem for a graph is that of labeling its vertices with distinct integers so that the maximum difference across an edge is minimized. In this study, the bandwidth of a tower graph Tm,n is investigated. A tower graph Tm,n is a block graph such that the following are satisfied:
1. the vertices can be partitioned into a cartesian product Km x Pn and an independent set; and,2. each vertex of the clique Km has exactly one neighbor in the independent set. |
|---|