Obtaining unit distance graphs by subdivision of edges
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
2001
|
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17173 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| 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. |
|---|