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...
Saved in:
Main Author: | Valdenor, Tristan C. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1997
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16454 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Some formulas and bounds for the bandwidth of graphs
by: Lim, Yvette F.
Published: (1999) -
On the fold thickness of some classes of graphs
by: Campena, Francis Joseph H.
Published: (2006) -
A study of singular and nonsingular graphs using reduction formulas
by: Alburo, Gertrude Pauline Gerona, et al.
Published: (1997) -
On the bandwidth of tower graphs
by: Garcia, Mark Anthony A.
Published: (2007) -
On the energy of some special classes of graphs
by: Angala, Bianca Marie P., et al.
Published: (2010)