Cycle isomorphism

Материал из WikiGrapp

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 [math]\displaystyle{ \,f }[/math] 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].

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.