Laman graph
In graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n vertices such that, for all k, every k-vertex subgraph has at most 2k − 3 edges, and such that the whole graph has exactly 2n − 3 edges. Laman graphs are named after Gerard Laman, of the University of Amsterdam, who in 1970 used them to characterize rigid planar structures.This characterization, however, had already been discovered in 1927 by Hilda Geiringer.
properties
primaryTopic
Laman graph
In graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n vertices such that, for all k, every k-vertex subgraph has at most 2k − 3 edges, and such that the whole graph has exactly 2n − 3 edges. Laman graphs are named after Gerard Laman, of the University of Amsterdam, who in 1970 used them to characterize rigid planar structures.This characterization, however, had already been discovered in 1927 by Hilda Geiringer.
has abstract
In graph theory, the Laman gra ...... ed in 1927 by Hilda Geiringer.
@en
Граф Ламана — граф з сімейства ...... ису пласких жорстких структур.
@uk
Лама́нов граф — граф из семейс ...... ания плоских жёстких структур.
@ru
Wikipage page ID
13,790,456
page length (characters) of wiki page
Wikipage revision ID
908,066,060
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
hypernym
comment
In graph theory, the Laman gra ...... ed in 1927 by Hilda Geiringer.
@en
Граф Ламана — граф з сімейства ...... ису пласких жорстких структур.
@uk
Лама́нов граф — граф из семейс ...... ания плоских жёстких структур.
@ru
label
Laman graph
@en
Граф Ламана
@uk
Ламанов граф
@ru