Good distance graphs and the geometry of
β
Li-Ping Huang
π
Article
π
2010
π
Elsevier Science
π
English
β 234 KB
Denote by G = (V, βΌ) a graph which V is the vertex set and βΌ is an adjacency relation on a subset of V Γ V . In this paper, the good distance graph is defined. Let (V, βΌ) and (V , βΌ ) be two good distance graphs, and Ο : V β V be a map. The following theorem is proved: Ο is a graph isomorphism β Ο i