The bandwidth of the tower graph Tm,2k
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 when n is even. A tower graph Tm,n is a block graph such that the following are sat...
Saved in:
Main Authors: | Lim, Yvette F., Garcia, Mark Anthony A. |
---|---|
Format: | text |
Published: |
Animo Repository
2008
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/6068 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Similar Items
-
The bandwidth of the tower graph Tm,n
by: Lim, Yvette F., et al.
Published: (2009) -
The bandwidth of tower graphs Tm,2 and Tm,3
by: Garcia, Mark Anthony A.
Published: (2007) -
On the bandwidth of tower graphs
by: Garcia, Mark Anthony A.
Published: (2007) -
The D-weight of a graph
by: Lapus, Raymond R.
Published: (2007) -
A sum labelling for some families of unicyclic graphs
by: Burgos, Jacob Francis C., et al.
Published: (2017)