Constructing unit-distance graphs by subdividing edges

• Main Author: Calayag, Ernita Rodriguez
• Format: text
• Language: English
• Published: Animo Repository 2002
• Subjects: Graphic methods; Graph theory; Representations of graphs; Numerical Analysis and Computation
• Online Access: https://animorepository.dlsu.edu.ph/etd_masteral/2634
• Institution: De La Salle University

A subdivision of graph G, S(G), is the result of subdividing some edges of G. The subdivision number of a graph G denoted by sd(G) is defined to be the minimum number of extra vertices inserted into the edges of G to make it isomorphic to a unit-distance graph in the plane (R2). A unit-distance grap...