Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
From MaRDI portal
Publication:6234366
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.
This page was built for publication: Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234366)
