2022/02/08 by Rhys J. Evans, Evans, Rhys J.
Mathematics · Neuroscience · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Graph theory and applications #Nuclear Receptors and Signaling
paper · pdf · doi:10.48550/arxiv.2202.03700
openalex publication_date 2022/02/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Given feasible strongly regular graph parameters (v,k,λ,μ) and a non-negative integer d, we determine upper and lower bounds on the order of a d-regular induced subgraph of any strongly regular graph with parameters (v,k,λ,μ). Our new bounds are at least as good as the bounds on the order of a d-regular induced subgraph of a k-regular graph determined by Haemers. Further, we prove that for each non-negative integer d, our new upper bound improves on Haemers' upper bound for infinitely many strongly regular graphs.