Fully disconnected graph

Материал из WikiGrapp

Fully disconnected graph --- вполне несвязный граф, регулярный степени 0 граф, пустой граф.

A graph that contains only isolated vertices is fully disconnected.

Источник — http://pco.iis.nsk.su/grapp/index.php?title=Fully_disconnected_graph&oldid=7342