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 with rigid edges of fixed lengths, embedded into Euclidean space. In a rigidity matroid for a graph with n vertices in d-dimensional space, a set of edges that defines a subgraph with k degrees of freedom has matroid rank dn − k. A set of edges is independent if and only if, for every edge in the set, removing the edge would increase the number of degrees of freedom of the remaining subgraph.
Link from a Wikipage to another Wikipage
primaryTopic
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 with rigid edges of fixed lengths, embedded into Euclidean space. In a rigidity matroid for a graph with n vertices in d-dimensional space, a set of edges that defines a subgraph with k degrees of freedom has matroid rank dn − k. A set of edges is independent if and only if, for every edge in the set, removing the edge would increase the number of degrees of freedom of the remaining subgraph.
has abstract
In the mathematics of structur ...... dom of the remaining subgraph.
@en
Wikipage page ID
36,758,654
page length (characters) of wiki page
Wikipage revision ID
1,024,495,947
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In the mathematics of structur ...... dom of the remaining subgraph.
@en
label
Rigidity matroid
@en