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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ramon, Haydee L., Tan, Michele G.
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
id oai:animorepository.dlsu.edu.ph:etd_bachelors-17686
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:etd_bachelors-176862022-01-26T01:36:39Z Obtaining unit distance graphs by subdivision of edges Ramon, Haydee L. Tan, Michele G. 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. 2001-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/etd_bachelors/17173 Bachelor's Theses English Animo Repository
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
description 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.
format text
author Ramon, Haydee L.
Tan, Michele G.
spellingShingle Ramon, Haydee L.
Tan, Michele G.
Obtaining unit distance graphs by subdivision of edges
author_facet Ramon, Haydee L.
Tan, Michele G.
author_sort Ramon, Haydee L.
title Obtaining unit distance graphs by subdivision of edges
title_short Obtaining unit distance graphs by subdivision of edges
title_full Obtaining unit distance graphs by subdivision of edges
title_fullStr Obtaining unit distance graphs by subdivision of edges
title_full_unstemmed Obtaining unit distance graphs by subdivision of edges
title_sort obtaining unit distance graphs by subdivision of edges
publisher Animo Repository
publishDate 2001
url https://animorepository.dlsu.edu.ph/etd_bachelors/17173
_version_ 1772835146084384768