{"paper":{"title":"Switched graphs of some strongly regular graphs related to the symplectic graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alice M.W. Hui, Bernardo Rodrigues","submitted_at":"2016-05-24T12:02:31Z","abstract_excerpt":"Applying a method of Godsil and McKay \\cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters $(2^n\\pm2^{(n-1)/2},2^{n-1}\\pm2^{(n-1)/2},2^{n-2}\\pm2^{(n-3)/2},2^{n-2}\\pm2^{(n-1)/2})$ are constructed for any odd $n \\geq 5$. The construction is described in terms of geometry of quadric in projective space. The binary linear codes of the switched graphs are $[2^n \\mp 2^{\\frac{n-1}{2}},n+3,2^{t+1}]_2$-code or $[2^n \\mp 2^{\\frac{n-1}{2}},n+3,2^{t+2}]_2$-code."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07400","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}