The bandwidth of the tower graph Tm,n

Authors

Yvette F. Lim, De La Salle University, Manila
Mark Anthony A. Garcia, De La Salle University, Manila

College

College of Science

Department/Unit

Mathematics and Statistics Department

Document Type

Conference Proceeding

Source Title

Proceedings of the 5th Asian Mathematical Conference

Volume

1

Publication Date

2009

Abstract

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 T_m,n is investigated. A tower graph T_m,n is a block graph such that the following are satisfied:

1. the vertices can be partitioned into a cartesian product K_m x P_n and an independent set; and,
2. each vertex of the clique K_m has exactly one neighbor in the independent set.

html

Recommended Citation

Lim, Y. F., & Garcia, M. A. (2009). The bandwidth of the tower graph Tm,n. Proceedings of the 5th Asian Mathematical Conference, 1 Retrieved from https://animorepository.dlsu.edu.ph/faculty_research/6069

Disciplines

Mathematics

Keywords

Graph labelings; Graph theory

Upload File

wf_no