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

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Cycle isomorphism''' --- циклический изоморфизм. A bijection <math>f</math> between the vertex sets <math>V_{1}</math> and <math>V_{2}</mat…»)
 
Нет описания правки
Строка 3: Строка 3:
A bijection <math>f</math> between the vertex sets <math>V_{1}</math> and <math>V_{2}</math> of two
A bijection <math>f</math> between the vertex sets <math>V_{1}</math> and <math>V_{2}</math> of two
''sigraphs'' <math>S_{1}</math> and <math>S_{2}</math>, respectively, is called f '''cycle isomorphism''' (or '''weak isomorphism''') between <math>S_{1}</math> and
''sigraphs'' <math>S_{1}</math> and <math>S_{2}</math>, respectively, is called f '''cycle isomorphism''' (or '''weak isomorphism''') between <math>S_{1}</math> and
<math>S_{2}</math> if <math>f</math> preserves both vertex adjacen\-cies and cycle signs of
<math>S_{2}</math> if <math>f</math> preserves both vertex adjacencies and cycle signs of
<math>S_{1}</math> and <math>S_{2}</math>.
<math>S_{1}</math> and <math>S_{2}</math>.

Версия от 15:42, 18 марта 2011

Cycle isomorphism --- циклический изоморфизм.

A bijection [math]\displaystyle{ f }[/math] between the vertex sets [math]\displaystyle{ V_{1} }[/math] and [math]\displaystyle{ V_{2} }[/math] of two sigraphs [math]\displaystyle{ S_{1} }[/math] and [math]\displaystyle{ S_{2} }[/math], respectively, is called f cycle isomorphism (or weak isomorphism) between [math]\displaystyle{ S_{1} }[/math] and [math]\displaystyle{ S_{2} }[/math] if [math]\displaystyle{ f }[/math] preserves both vertex adjacencies and cycle signs of [math]\displaystyle{ S_{1} }[/math] and [math]\displaystyle{ S_{2} }[/math].