История

Glk

Новая страница: «'''Finite graph''' --- конечный граф. The graph <math>G = (V,E)</math> is said to be '''finite''' if both <math>n = |V|</math> and <math>m = |E|</math>…»