Geometrical approach to Seidel's switching for strongly regular graphs
arXiv:0909.2603
Abstract
In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let be a primitive strongly regular graph with parameters . Let be the graph from by switching with respect to a nonempty . Suppose where is the nontrivial positive eigenvalue of the adjacency matrix of . This strongly regular graph is associated with a regular two-graph. Then, is a strongly regular graph with the same parameters if and only if the subgraph induced by is regular. Moreover, is a strognly regualr graph with the other parameters if and only if the subgraph induced by is regular and the size of is . We prove these theorems with the view point of the geometrical theory of the finite set on the Euclidean unit sphere.
arXiv comment9 pages, no figure