{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1977366","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q1977366","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q1977366","kernelVersion":"v1","immutable":true,"modified":"2026-01-01T20:28:48Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q1977366","name":"The strongly regular (40, 12, 2, 4) graphs","headline":"The strongly regular (40, 12, 2, 4) graphs","description":"scientific article; zbMATH DE number 1446314","url":"https://portal.mardi4nfdi.de/entity/Q1977366","datePublished":"2000-05-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q162968"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q161296"}],"comment":"Summary: In a previous paper [cf. \\textit{E. Spence}, (40, 13, 4) designs derived from strongly regular graphs, Advances in finite geometries and designs, Proc. 3rd Isle of Thorns Conf., Chelwood Gate/UK 1990, 359-368 (1991; Zbl 0760.05007)] it was established that there are at least \\(27\\) non-isomorphic strongly regular \\((40,12,2,4)\\) graphs. Using a different and more efficient method we have re-investigated these graphs and have now been able to determine them all, and so complete the classification. We have discovered that there are precisely \\(28\\) non-isomorphic \\((40,12,2,4)\\) strongly regular graphs. The one that was not found in the previous investigation is characterised uniquely by the fact that every neighbour graph is triangle-free."},"provenance":{"prov:generatedAtTime":"2026-01-01T20:28:48Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}