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:
| 主要作者: | |
|---|---|
| 格式: | text |
| 出版: |
Animo Repository
2007
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/faculty_research/6070 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|