Simplicial vertex
Материал из WikiGrapp
Simplicial vertex --- симплициальная вершина.
A vertex [math]\displaystyle{ v \in V }[/math] is simplicial in [math]\displaystyle{ G }[/math], if a closed neighborhood [math]\displaystyle{ N[v] }[/math] is a clique in [math]\displaystyle{ G }[/math].
