2012/07/13 by Shisen Luo, Luo, Shisen
Computer Science · Mathematics · Engineering · #Interconnection Networks and Systems #Graph theory and applications #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1207.3319
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 \citeLuo:Rigidity and answers some questions raised there.