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 |
| id |
oai:animorepository.dlsu.edu.ph:faculty_research-6958 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:faculty_research-69582022-06-03T05:48:23Z The bandwidth of the tower graph Tm,n Lim, Yvette F. Garcia, Mark Anthony A. 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. 2009-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/6069 Faculty Research Work Animo Repository Graph labelings Graph theory 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 labelings Graph theory Mathematics |
| spellingShingle |
Graph labelings Graph theory Mathematics Lim, Yvette F. Garcia, Mark Anthony A. The bandwidth of the tower graph Tm,n |
| description |
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. |
| format |
text |
| author |
Lim, Yvette F. Garcia, Mark Anthony A. |
| author_facet |
Lim, Yvette F. Garcia, Mark Anthony A. |
| author_sort |
Lim, Yvette F. |
| title |
The bandwidth of the tower graph Tm,n |
| title_short |
The bandwidth of the tower graph Tm,n |
| title_full |
The bandwidth of the tower graph Tm,n |
| title_fullStr |
The bandwidth of the tower graph Tm,n |
| title_full_unstemmed |
The bandwidth of the tower graph Tm,n |
| title_sort |
bandwidth of the tower graph tm,n |
| publisher |
Animo Repository |
| publishDate |
2009 |
| url |
https://animorepository.dlsu.edu.ph/faculty_research/6069 |
| _version_ |
1767196470101934080 |