Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry (Q2025155): Difference between revisions

A graph of order \(v\) is strongly regular, abbreviated \(\mathrm{srg}(v,k,\lambda,\mu)\), if it is \(k\)-regular (i.e. any vertex has exactly \(k\) neighbours), any two adjacent vertices have exactly \(\lambda\) common neighbours, and any two nonadjacent vertices have exactly \(\mu\) common neighbours. This paper identifies twelve new strongly regular graphs of type \(\mathrm{srg}(81, 30, 9, 12)\), bringing the total number to \(14\) for this tuple of parameters. The methodology uses orbit matrices along with a Magma-assisted analysis of the automorphism groups of two previously known \(\mathrm{srg}(81, 30, 9, 12)\). Subgroup orders \(972\) and \(360\) are studied in detail. The article gives a link to a file of adjacency matrices, as well as a table of data on the graphs (which also aids in distinguishing them). One of the new strongly regular graphs is geometric, arising from a partial geometry \(\mathrm{pg}(5,5,2)\). This is different from the classical one arising from a ternary linear two-weight code.