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

Материал из WEGA
Перейти к навигации Перейти к поиску
(Новая страница: «'''Vertex switch''' --- переключатель вершин. A ''' vertex switch''' of a simple, undirected graph <math>G = (V,E)</math> at a vertex <math>v</m…»)
 
Нет описания правки
 
Строка 6: Строка 6:
first introduced by van Lint and Seidel and is often referred to as
first introduced by van Lint and Seidel and is often referred to as
''' Seidel switching'''. 
''' Seidel switching'''. 
Switching has been studied in the context of '' pan-cyclic graphs'',
'' acyclic graphs'', '' isomorfism'', and reconstruction.

Текущая версия от 13:48, 30 августа 2011

Vertex switch --- переключатель вершин.

A vertex switch of a simple, undirected graph [math]\displaystyle{ G = (V,E) }[/math] at a vertex [math]\displaystyle{ v }[/math] is obtained by deleting the edges incident to [math]\displaystyle{ v }[/math] ad adding to [math]\displaystyle{ G }[/math] all edges that are incident to [math]\displaystyle{ v }[/math] in [math]\displaystyle{ \bar{G} }[/math]. Vertex switching was first introduced by van Lint and Seidel and is often referred to as Seidel switching.  Switching has been studied in the context of pan-cyclic graphs, acyclic graphs, isomorfism, and reconstruction.