spectral_moore_seidel_switch
def
Seidel switching: for a simple graph G : SimpleGraph V and a set X : Set V, the simple graph on V in which distinct vertices u, v are adjacent iff (G.Adj u v ↔ (u ∈ X ↔ v ∈ X)); that is, edges and non-edges are kept inside X and inside its complement and interchanged between X and its complement.
Statement
def spectral_moore_seidel_switch {V : Type*} (G : SimpleGraph V) (X : Set V) : SimpleGraph V
- Source
- arXiv:2611.00591 (A spectral Moore problem and the Yang-Koolen conjecture), Section 5, Seidel switching
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Used by 3
- spectral_moore_seidel_switch_adj_quadform_leLet G be a k-regular finite simple graph on V with second largest adjacency eigenvalue at most θ and k ≤ θ + |V|/2. Then for every X : Set…
- spectral_moore_seidel_switch_degree_sum_geLet G be a k-regular finite simple graph on V with n = |V| ≥ 2k + 2, X : Set V, and suppose every vertex of the Seidel switching F =…
- spectral_moore_max_order_le_of_large_degree_of_switch_degree_boundsLet θ ≥ 1. Suppose (i) there are D, N₀ such that every k-regular graph G on Fin n with second largest adjacency eigenvalue at most θ, 2k +…
Lean source view module on GitHub
/-- Seidel switching of `G` with respect to the vertex set `X`. -/ def spectral_moore_seidel_switch {V : Type*} (G : SimpleGraph V) (X : Set V) : SimpleGraph V where Adj u v := u ≠ v ∧ (G.Adj u v ↔ (u ∈ X ↔ v ∈ X)) symm := by constructor intro u v h exact ⟨h.1.symm, by rw [G.adj_comm]; exact h.2.trans (by tauto)⟩ loopless := by constructor intro u h exact h.1 rfl