Some formulas and bounds for the bandwidth of graphs
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, this problem is solved for the graph called flowerette Fn defined by Fortes [9] for all values of n. This is a graph which consists of...
Saved in:
主要作者: | |
---|---|
格式: | text |
語言: | English |
出版: |
Animo Repository
1999
|
主題: | |
在線閱讀: | https://animorepository.dlsu.edu.ph/etd_doctoral/804 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!