On the bandwidth of generalized Petersen graphs
Date of Publication
2006
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Yvette F. Lim
Defense Panel Member
Isagani B. Jos
Leonor A. Ruivivar
Mark Anthony A. Garcia
Abstract/Summary
The bandwidth of a graph G is the minimum of the quantity max{f(u) - f(v) : uv is an edge of G} taken over all injective integer labelings f of G. This paper aims to determine the bandwidth of generalized Petersen graphs from order 6 to 16. The generalized Petersen graph, denoted by Pn,k has 2n vertices x1, x2,..., xni, Y1, Y2,..., Yn and edges [X1, X2], [X2, X3],...,[Xn-1, Xn], [Xn, X1] [X1, Y1], [X2, Y2],...,[Xn, Yn] and all edges of the form [Yi, Yi +k], i = 1,2,...,n where n-3 and k is an integer satisying 1-k- 2-1 and i + k is read modulo n.
Abstract Format
html
Language
English
Format
Accession Number
TU13530
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vi, 47 leaves : ill.
Keywords
Equations; Linear equations; Algebra--Graphic method; Integral equations; Differential equations, Linear
Recommended Citation
Pusong, M. B., & Villacorta, K. P. (2006). On the bandwidth of generalized Petersen graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17430
