Locally restricted graph

Locally restricted graph --- локально ограниченный граф.

A graph [math]\displaystyle{ G = (V,A) }[/math] is called locally restricted if it has a bounded degree, i.e. if there is a constant [math]\displaystyle{ M \gt 0 }[/math] such that [math]\displaystyle{ deg(v) \leq M }[/math] for any vertex [math]\displaystyle{ v \in V }[/math].