Skip to search formSkip to main contentSkip to account menu

Rigidity matroid

In the mathematics of structural rigidity, a rigidity matroid is a matroid that describes the number of degrees of freedom of an undirected graph… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
  • S. Luo
  • 2012
  • Corpus ID: 117189423
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and… 
2010
2010
2010
2010
The problem of characterizing the generic rigidity matroid combinatorially is completely solved in dimension 2 but still open in… 
2006
2006
In this paper we consider the 3-dimensional rigidity matroid of squares of graphs. These graphs are also called molecular graphs… 
Highly Cited
2005
Highly Cited
2005
Review
2005
Review
2005
It is an open problem to find a good characterization for independence or, more generally, the rank function in the d-dimensional… 
2004
2004
Let ${\mathcal R}_{d}(G)$ be the d-dimensional rigidity matroid for a graph G=(V,E). Combinatorial characterization of… 
2004
2004
RIGIDITY IN m-SPACE JACK E. GRAVER, BRIGITTE SERVATIUS, AND HERMAN SERVATIUS Abstract. Matroid theory has many classical…