| Article ID: | iaor201530340 |
| Volume: | 116 |
| Issue: | 2 |
| Start Page Number: | 175 |
| End Page Number: | 178 |
| Publication Date: | Feb 2016 |
| Journal: | Information Processing Letters |
| Authors: | Katoh Naoki, Kobayashi Yuki, Higashikawa Yuya, Sljoka Adnan |
| Keywords: | graphs |
In this paper, we characterize the redundant rigidity and the redundant global rigidity of body-hinge graphs in Rˆd in terms of graph connectivity. Although an efficient algorithm which determines mixed-connectivity is still not known, our result implies that both edge-redundancy for rigidity and edge-redundancy for global rigidity can be checked via efficient graph-connectivity algorithms.