Seidel Switching
Files
Date
2011-02-16
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Seidel switching is a technique for generating pairs of graphs that are cospectral but not necessarily isomorphic. We will discuss and prove some important properties related to this graph construction. Cospectral pairs of regular graphs are rarer than cospectral pairs of non-regular graphs. As a result, after looking at how to construct graphs via the Seidel technique we will look specifically at generating regular pairs of graphs via the Seidel switching technique.
Description
Keywords
seidel switching, graph theory, graph construction, cospectral