{"paper":{"title":"New strongly regular graphs derived from the G2(4) graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Thomas Jenrich","submitted_at":"2014-09-11T18:06:35Z","abstract_excerpt":"We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices, each of them has exactly k neighbours, and the number of common neighbours of any two different vertices is l if they are neighbours and m otherwise.\n  The G2(4) graph is a well-known srg(416,100,36,20). In this article, we explicitly construct it and a certain subgraph E induced by 320 vertices in the same way as in an older article by this author. We discover some interesting properties of E and derive five strong"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3520","kind":"arxiv","version":4},"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"}