Geometrical approach to Seidel's switching for strongly regular graphs
Hiroshi Nozaki

TL;DR
This paper presents a simplified geometric framework for understanding Seidel's switching in strongly regular graphs, characterizing when switching preserves or alters graph parameters based on induced subgraph regularity.
Contribution
It introduces a geometric approach to Seidel's switching, providing clear conditions for when the resulting graph remains strongly regular or changes parameters.
Findings
Switching preserves strong regularity if the induced subgraph is appropriately regular.
Switching alters parameters if the induced subgraph has specific regularity and size.
Geometric perspective simplifies understanding of Seidel's switching in strongly regular graphs.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Finite Group Theory Research · graph theory and CDMA systems
