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:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1999
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_doctoral/804 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
Be the first to leave a comment!