no. 14 · Friday 13 November 2026
On identity Seidel switches
Abstract
An identity Seidel switch of a graph is a vertex subset whose Seidel switch produces an isomorphic graph. We distinguish the elementary abelian group of switching operations from the family of identity switches of a fixed graph, which need not be a group. We obtain an edge-count condition for identity switches and deduce that every vertex-identity switch has degree half the number of remaining vertices. In particular, no graph of order at least two has every vertex as an identity switch. For a two-vertex switching set inducing an edge, we characterize the switches admitting an isomorphism that preserves the endpoint pair, in terms of automorphisms of the remaining induced subgraph. We establish modification results under this additional hypothesis and give explicit constructions of identity switches. Counterexamples show why edge-count conditions and unrestricted modification assertions do not suffice.
- comments
- 14 pages; algebraic view of the Seidel switch
- fields
- Combinatorics