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

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.

21 pages, 26 figures

References in corpus (2)

• Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
• On Graph Cohomology and Betti Numbers of Hamiltonian GKM Manifolds

Cited by in corpus (2)

• Lower bound for the rank of rigidity matrix of 4-valent graphs under various connectivity assumptions
• On Graph Cohomology and Betti Numbers of Hamiltonian GKM Manifolds