Pseudograph

Pseudograph --- псевдограф.

Let [math]\displaystyle{ G = (V,E) }[/math] be a digraph on [math]\displaystyle{ n }[/math] vertices. [math]\displaystyle{ G }[/math] is called a pseudograph, if it permits loops but no multiple arcs in [math]\displaystyle{ D }[/math].