Geometrical approach to Seidel's switching for strongly regular graphs

preprint2010arXivOpen access

Abstract

In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows. Let G=(V,E)G=(V,E) be a primitive strongly regular graph with parameters (v,k,λ,μ)(v,k,λ,μ). Let S(G,H)S(G,H) be the graph from GG by switching with respect to a nonempty H⊂VH\subset V. Suppose v=2(k−θ1)v=2(k-θ_1) where θ1θ_1 is the nontrivial positive eigenvalue of the (0,1)(0,1) adjacency matrix of GG. This strongly regular graph is associated with a regular two-graph. Then, S(G,H)S(G,H) is a strongly regular graph with the same parameters if and only if the subgraph induced by HH is k−v−h2k-\frac{v-h}{2} regular. Moreover, S(G,H)S(G,H) is a strognly regualr graph with the other parameters if and only if the subgraph induced by HH is k−μk-μ regular and the size of HH is v/2v/2. We prove these theorems with the view point of the geometrical theory of the finite set on the Euclidean unit sphere.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.