GraphTheory[SeidelSwitch]
|
Calling Sequence
|
|
SeidelSwitch(G, S, ip)
|
|
Parameters
|
|
G
|
-
|
undirected and unweighted graph
|
S
|
-
|
list of vertices of the graph
|
ip
|
-
|
equation of the form inplace=true or false (optional)
|
|
|
|
|
Description
|
|
•
|
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.
|
|
|
Examples
|
|
>
|
|
>
|
|
>
|
|
>
|
|
| (1) |
>
|
|
| (2) |
>
|
|
| (3) |
Vertices 1 and 2 remain neighbors of each other
>
|
|
>
|
|
| (4) |
>
|
|
| (5) |
>
|
|
| (6) |
|
|
Download Help Document
Was this information helpful?