Lower Bound For The Rank Of 2-Dimensional Generic Rigidity Matroid For Regular Graphs Of Degree Four And Five

2012/05/20 by Luo, Shisen
#52C25 (Primary) 05C50 (Secondary) #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.1205.4382

Abstract

In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.

Related

• Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
• 5-regular graphs and the 3-dimensional rigidity matroid
• Maxwell-independence: a new rank estimate for 3D rigidity matroids
• Rank Contributions of Vertices in Rigidity Matroids of Clique Covered Graphs
• Rigidity of nearly planar classes of graphs