Mathematics > Combinatorics
[Submitted on 14 Sep 2009 (v1), last revised 7 Jan 2010 (this version, v2)]
Title:Geometrical approach to Seidel's switching for strongly regular graphs
View PDFAbstract: In this paper, we simplify the known switching theorem due to Bose and Shrikhande as follows.
Let $G=(V,E)$ be a primitive strongly regular graph with parameters $(v,k,\lambda,\mu)$.
Let $S(G,H)$ be the graph from $G$ by switching with respect to a nonempty $H\subset V$.
Suppose $v=2(k-\theta_1)$ where $\theta_1$ is the nontrivial positive eigenvalue of the $(0,1)$ adjacency matrix of $G$. This strongly regular graph is associated with a regular two-graph.
Then, $S(G,H)$ is a strongly regular graph with the same parameters if and only if the subgraph induced by $H$ is $k-\frac{v-h}{2}$ regular. Moreover, $S(G,H)$ is a strognly regualr graph with the other parameters if and only if the subgraph induced by $H$ is $k-\mu$ regular and the size of $H$ is $v/2$. We prove these theorems with the view point of the geometrical theory of the finite set on the Euclidean unit sphere.
Submission history
From: Hiroshi Nozaki Dr. [view email][v1] Mon, 14 Sep 2009 17:20:23 UTC (10 KB)
[v2] Thu, 7 Jan 2010 22:42:17 UTC (10 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.