Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions

preprint2012arXivOpen access

Abstract

In this paper we study the rank of planar rigidity matrix of 4-valent graphs, both in case of generic realizations and configurations in general position, under various connectivity assumptions on the graphs. For each case considered, we prove a lower bound and provide an example which shows the order of the bound we proved is sharp. This work is closed related to work in \cite{Luo:Rigidity} and answers some questions raised there.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.