Strongly regular graphs with non-trivial automorphisms

DOI10.1016/J.DISC.2010.10.005zbMATH Open1225.05248OpenAlexW2064645351MaRDI QIDQ615990FDOQ615990

Authors: Sumit K. Garg 

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

Recommendations

• On strongly regular graphs with \(\mu = 1\) and their automorphisms
• On the automorphism groups of strongly regular graphs. I
• Automorphisms of strongly regular graphs with applications to partial difference sets
• On automorphisms of strongly regular locally cyclic graphs
• A generalization of strongly regular graphs
• On the automorphism groups of strongly regular graphs. II.
• Construction of strongly regular graphs having an automorphism group of composite order
• scientific article; zbMATH DE number 3979110
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2
• On automorphisms of strongly regular graphs with $ \lambda=0$, $ \mu=2$

zbMATH Keywords

strongly regular graphautomorphismparameter sets

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• The strongly regular (40, 12, 2, 4) graphs
• Classification of regular two-graphs on 36 and 38 vertices
• The pseudo-geometric graphs for generalized quadrangles of order \((3,t)\)
• The strongly regular (45,\,12,\,3,\,3) graphs
• On self-complementary strongly regular graphs
• A (49,16,3,6) strongly regular graph does not exist
• On the automorphisms of the strongly regular graph with parameters \((85,14,3,2)\)
• Classification of some strongly regular subgraphs of the McLaughlin graph
• Using algebraic properties of minimal idempotents for exhaustive computer generation of association schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On automorphisms of strongly regular graphs with parameters λ = 1, μ = 2

Cited In (44)

• Self-orthogonal codes from orbit matrices of Seidel and Laplacian matrices of strongly regular graphs
• Construction of strongly regular graphs having an automorphism group of composite order
• Automorphisms of a strongly regular graph with parameters \((1197,156,15,21)\)
• On triple systems and strongly regular graphs
• 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
• On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$
• \(r\)-regular families of graph automorphisms
• On small symmetric strongly regular graphs
• Strongly regular graphs with parameters \((37, 18, 8, 9)\) having nontrivial automorphisms
• Automorphisms of strongly regular graphs with applications to partial difference sets
• On automorphisms of a distance-regular graph with intersection array \(\{39,36,22;1,2,18\}\)
• Automorphisms of an \(AT4(4, 4, 2)\)-graph and of the corresponding strongly regular graphs
• Self-orthogonal codes from row orbit matrices of strongly regular graphs
• Automorphisms of a distance-regular graph with intersection array \(\{39,36,4;1,1,36\}\)
• The adjacency codes of the first yellow graphs
• On a distance-regular graph with an intersection array \(\{35,28,6;1,2,30\}\)
• Title not available (Why is that?)
• On automorphisms of a strongly regular graph with parameters \((88, 27, 6, 9)\)
• On automorphisms of a distance-regular graph with intersection array \(\{44,30,5;1,3,40\}\)
• Automorphisms of a distance regular graph with intersection array \(\{48,35,9;1,7,40\}\)
• On automorphisms of a strongly regular graph with parameters \((210,95,40,45)\)
• There is no (75,32,10,16) strongly regular graph
• Self-orthogonal codes from the strongly regular graphs on up to 40 vertices
• On self-orthogonal designs and codes related to Held's simple group
• New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
• Switching of edges in strongly regular graphs. I: A family of partial difference sets on 100 vertices
• The prime spectrum of an automorphism group of an 𝐴𝑇4(𝑝,𝑝+2,𝑟)-graph
• On automorphisms of strongly regular graphs with parameters (486, 100, 22, 20)
• Strongly regular graphs admitting an automorphism group with two orbits.
• On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\)
• Title not available (Why is that?)
• Automorphisms of the Cameron's monster with parameters \((6138, 1197, 156, 252)\)
• On automorphisms of a distance-regular graph with intersection of arrays \(\{39,30,4; 1,5,36\}\)
• Automorphisms of the AT4(6; 6; 3)-graph and its Strongly-regular Graphs
• Automorphisms of a distance-regular graph with intersection array \(\{176, 135, 32, 1; 1, 16, 135, 176\}\)
• On automorphisms of semitriangular graphs with \(\mu = 8\)
• Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
• On automorphism groups of \(\mathrm{AT}4(7, 9, r)\)-graphs and of their local subgraphs
• Small vertex-symmetric Higman graphs with \(\mu=6\)
• Automorphisms of distance-regular graph with intersection array \(\{144,125,32,1;1,8,125,144\}\)
• Self-orthogonal codes from Deza graphs, normally regular digraphs and Deza digraphs
• On the automorphism group of an antipodal tight graph of diameter 4 with parameters \((5, 7, r)\)
• Title not available (Why is that?)

This page was built for publication: Strongly regular graphs with non-trivial automorphisms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615990)