Learn More
We examine the generic local and global rigidity of various graphs in R d. We analyze two classes of graphs that satisfy Hendrick-son's conditions for generic global rigidity, yet fail to be generically globally rigid. We find a large family of bipartite graphs with d > 3, and we use a method that generates infinitely many graphs in R 5. Finally, we state(More)
  • 1