Graphs and Combinatorics

, Volume 6, Issue 4, pp 365–367

On the dimension to represent a graph by a unit distance graph

  • Hiroshi Maehara
  • Vojtech Rödl


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Hiroshi Maehara
    • 1
  • Vojtech Rödl
    • 2
  1. 1.College of EducationRyukyu UniversityOkinawaJapan
  2. 2.Emory UniversityAtlantaUSA

Personalised recommendations