Výpočetní složitost v teorii grafů
Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non-adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching-equivalent if one can be made isomorphic to the other by a sequence of swit...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | English |
| Published: |
2006
|
| Online Access: | http://www.nusl.cz/ntk/nusl-267473 |