Strongly regular graphs with non-trivial automorphisms
From MaRDI portal
Publication:615990
DOI10.1016/j.disc.2010.10.005zbMath1225.05248OpenAlexW2064645351MaRDI QIDQ615990
Publication date: 7 January 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.10.005
Related Items
On automorphisms of strongly regular graphs with parameters (486, 100, 22, 20), Self-orthogonal codes from the strongly regular graphs on up to 40 vertices, Unnamed Item, New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\), Unnamed Item, Unnamed Item, Unnamed Item, On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\), On automorphism groups of \(\mathrm{AT}4(7, 9, r)\)-graphs and of their local subgraphs, On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$, Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs, On triple systems and strongly regular graphs, Strongly regular graphs with parameters (37, 18, 8, 9) having nontrivial automorphisms, Small vertex-symmetric Higman graphs with \(\mu=6\), Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs, AUTOMORPHISMS OF DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {39; 36; 4; 1; 1; 36}, On automorphisms of a strongly regular graph with parameters \((210,95,40,45)\), On automorphisms of semitriangular graphs with \(\mu = 8\), The prime spectrum of an automorphism group of an 𝐴𝑇4(𝑝,𝑝+2,𝑟)-graph, Automorphisms of distance-regular graph with intersection array \(\{144,125,32,1;1,8,125,144\}\), Unnamed Item, On automorphisms of a distance-regular graph with intersection array \(\{39,36,22;1,2,18\}\), On small symmetric strongly regular graphs, On automorphisms of a strongly regular graph with parameters \((88, 27, 6, 9)\), Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry, On self-orthogonal designs and codes related to Held's simple group, There is no (75,32,10,16) strongly regular graph, Automorphisms of a distance-regular graph with intersection array \(\{176, 135, 32, 1; 1, 16, 135, 176\}\), О дистанционно регулярном графе с массивом пересечений {35,28,6;1,2,30}, Automorphisms of a Distance Regular Graph with Intersection Array {48,35,9;1,7,40}, On the automorphism group of an antipodal tight graph of diameter 4 with parameters \((5, 7, r)\), Automorphisms of an \(AT4(4, 4, 2)\)-graph and of the corresponding strongly regular graphs, On automorphisms of a distance-regular graph with intersection array \(\{44,30,5;1,3,40\}\), Automorphisms of small graphs with intersection array \(\{nm-1, nm-n+m-1,n-m+1;1,1,nm-n+m-1\}\), Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group, Automorphisms of the AT4(6; 6; 3)-graph and its Strongly-regular Graphs, Construction of strongly regular graphs having an automorphism group of composite order
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
- On self-complementary strongly regular graphs
- A (49,16,3,6) strongly regular graph does not exist
- The strongly regular (40, 12, 2, 4) graphs
- Classification of some strongly regular subgraphs of the McLaughlin graph
- The strongly regular (45,\,12,\,3,\,3) graphs
- On the automorphisms of the strongly regular graph with parameters (85, 14, 3, 2)
- On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
- The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
