SeidelSwitch(G, S, opts)
undirected and unweighted graph
list of vertices of the graph
zero or more options as specified below
Specifies whether the changes are applied to the original graph or to a copy. The default is true, meaning the original graph is changed.
The SeidelSwitch command transforms the input graph to a new graph in such a way that, for each specified vertex, its neighbors become its non-neighbors and vice versa.
By default, the original graph is changed and the switching happens in place. By setting inplace=false the original graph remains unchanged.
G ≔ CycleGraph⁡5
G≔Graph 1: an undirected unweighted graph with 5 vertices and 5 edge(s)
H ≔ SeidelSwitch⁡G,1,2,inplace=false
H≔Graph 2: an undirected unweighted graph with 5 vertices and 7 edge(s)
Vertices 1 and 2 remain neighbors of each other
Graph 1: an undirected unweighted graph with 5 vertices and 7 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)