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: | |
|---|---|
| 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 |
| id |
oai:animorepository.dlsu.edu.ph:etd_bachelors-16967 |
|---|---|
| record_format |
eprints |
| spelling |
oai:animorepository.dlsu.edu.ph:etd_bachelors-169672021-11-13T03:54:02Z Bandwidth of some classes of graphs Valdenor, Tristan C. 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. 1997-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/16454 Bachelor's Theses English Animo Repository Graphic methods Graphs, Theory of Mathematics--Formulae |
| institution |
De La Salle University |
| building |
De La Salle University Library |
| continent |
Asia |
| country |
Philippines Philippines |
| content_provider |
De La Salle University Library |
| collection |
DLSU Institutional Repository |
| language |
English |
| topic |
Graphic methods Graphs, Theory of Mathematics--Formulae |
| spellingShingle |
Graphic methods Graphs, Theory of Mathematics--Formulae Valdenor, Tristan C. Bandwidth of some classes of graphs |
| description |
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. |
| format |
text |
| author |
Valdenor, Tristan C. |
| author_facet |
Valdenor, Tristan C. |
| author_sort |
Valdenor, Tristan C. |
| title |
Bandwidth of some classes of graphs |
| title_short |
Bandwidth of some classes of graphs |
| title_full |
Bandwidth of some classes of graphs |
| title_fullStr |
Bandwidth of some classes of graphs |
| title_full_unstemmed |
Bandwidth of some classes of graphs |
| title_sort |
bandwidth of some classes of graphs |
| publisher |
Animo Repository |
| publishDate |
1997 |
| url |
https://animorepository.dlsu.edu.ph/etd_bachelors/16454 |
| _version_ |
1772835233766309888 |