Bandwidth of some classes of graphs
This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem for a graph G is to label its n vertices v1, with distinct integers f(v1) so that the quantity /f(v,)-f(v1)/:[v,v,]E E(G) is minimized. This thesis describes some properties on bandwidth, some known a...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Animo Repository
1997
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/16454 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| المؤسسة: | De La Salle University |
| اللغة: | English |
| الملخص: | This thesis presents a partial solution to the broad problem on bandwidths. The bandwidth problem for a graph G is to label its n vertices v1, with distinct integers f(v1) so that the quantity /f(v,)-f(v1)/:[v,v,]E E(G) is minimized. This thesis describes some properties on bandwidth, some known and some new results on bandwidth of special classes of graphs and their complements. The results here include bandwidth of star graphs, paths, cycles, complete bipartite graphs, fans and all their complements, sum of some special graphs and their complements and cross-products of some special graphs. Most of the theorems were proven by finding upper adn lower bounds on the bandwidth and using them to obtain the exact values of the bandwidth. |
|---|