The Vertex-Switching Reconstruction Problem
Switching on a vertex of a graph involves swapping the sets of neighbours and non-neighbours of the vertex. The resultant graph is called a switch card of the original graph. The switch deck of a graph is the collection of all of its switch cards. The vertex-switch reconstruction problem then asks w...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en |
| Published: |
University of Ottawa (Canada)
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/28629 http://dx.doi.org/10.20381/ruor-12635 |