Unigraph

Unigraph --- униграф.

A graph [math]\displaystyle{ G }[/math] is called unigraph if [math]\displaystyle{ G }[/math] is determined by its degree sequence up to isomorphism, i.e. if a graph [math]\displaystyle{ H }[/math] has the same degree sequence as [math]\displaystyle{ G }[/math], then [math]\displaystyle{ H }[/math] is isomorphic to [math]\displaystyle{ G }[/math].