Triangulated triangle

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

Triangulated triangle --- триангулированный треугольник.

The triangulated triangle [math]\displaystyle{ T_{l} }[/math] is the graph whose vertices are the triples of nonnegative integers summing to [math]\displaystyle{ l }[/math], with an edge connecting two triples, if they agree in one coordinate and differ by 1 in other two coordinates.