Аноним

Unigraph: различия между версиями

Материал из WEGA
Новая страница: «'''Unigraph''' --- униграф. A graph <math>G</math> is called ''' unigraph''' if <math>G</math> is determined by its ''degree sequence'' up to '' isomorphism…»
(Новая страница: «'''Unigraph''' --- униграф. A graph <math>G</math> is called ''' unigraph''' if <math>G</math> is determined by its ''degree sequence'' up to '' isomorphism…»)
 
(нет различий)
4189

правок