Bandwidth of some classes of graphs
Date of Publication
1997
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
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.
Abstract Format
html
Language
English
Format
Accession Number
TU08315
Shelf Location
Archives, The Learning Commons, 12F Henry Sy Sr. Hall
Physical Description
45 leaves
Keywords
Graphic methods; Graphs, Theory of; Mathematics--Formulae
Recommended Citation
Valdenor, T. C. (1997). Bandwidth of some classes of graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16454
