Constructing unit-distance graphs by subdividing edges

• 主要作者: Calayag, Ernita Rodriguez
• 格式: text
• 語言: English
• 出版: Animo Repository 2002
• 主題: Graphic methods; Graph theory; Representations of graphs; Numerical Analysis and Computation
• 在線閱讀: https://animorepository.dlsu.edu.ph/etd_masteral/2634
• 機構: 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...