Obtaining unit distance graphs by subdivision of edges
Date of Publication
2001
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
After stating the definitions of some basic terms and illustrating them through examples, the reader is then brought to understanding the relationship of dimensions and subdivision numbers of some special classes of graphs. It was shown in this research paper that after subdividing a number of edges, graphs with dimension greater than or equal to 3 such as fans, complete bipartite graphs and complete graphs were transformed into unit-distance graphs represented in the Euclidean plane. In addition, fans, complete bipartite and complete graphs are determined to explicitly illustrate the main concepts.
Abstract Format
html
Language
English
Format
Accession Number
TU10735
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
71 leaves
Recommended Citation
Ramon, H. L., & Tan, M. G. (2001). Obtaining unit distance graphs by subdivision of edges. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17173
