e/Laman graph

Information
has gloss	eng: 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.
lexicalization	eng: Laman graph
instance of	c/Geometric graphs

Meaning
Russian
has gloss	rus: В теории графов Лама́новым графом с n вершинами называют такой граф G, что, во-первых, для каждого k любой подграф графа G, содержащий k вершин, имеет не более, чем 2k −3 ребра и, во-вторых, граф G имеет ровно 2n −3 ребра.
lexicalization	rus: Ламанов граф