On the dimension to represent a graph by a unit distance graph
- Cite this article as:
- Maehara, H. & Rödl, V. Graphs and Combinatorics (1990) 6: 365. doi:10.1007/BF01787703
- 90 Views
It is proved that if a graphG has maximum degreed, then its vertices can be represented by distinct unit vectors inR2d so that two vectors are orthogonal if and only if the corresponding vertices are adjacent. As a corollary it follows that if a graph has maximum degreed, then it is isomorphic to a “unit distance graph” inR2d.