{"title":"Strongly Regular Graphs from Pseudocyclic Association Schemes","authors":"Koji Momihara, Sho Suda","doi":"10.1007/s00373-024-02764-x","DOIUrl":null,"url":null,"abstract":"<p>In this paper, we give a construction of strongly regular graphs from pseudocyclic association schemes, which is a common generalization of two constructions given by Fujisaki (2004). Furthermore, we prove that the pseudocyclic association scheme arising from the action of PGL(2, <i>q</i>) to the set of exterior lines in PG(2, <i>q</i>), called the elliptic scheme, under the assumption that <span>\\(q=2^m\\)</span> with <i>m</i> an odd prime satisfies the condition of our new construction. As a consequence, we obtain a new infinite family of strongly regular graphs of Latin square type with non-prime-power number of vertices.</p>","PeriodicalId":12811,"journal":{"name":"Graphs and Combinatorics","volume":"23 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphs and Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00373-024-02764-x","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we give a construction of strongly regular graphs from pseudocyclic association schemes, which is a common generalization of two constructions given by Fujisaki (2004). Furthermore, we prove that the pseudocyclic association scheme arising from the action of PGL(2, q) to the set of exterior lines in PG(2, q), called the elliptic scheme, under the assumption that \(q=2^m\) with m an odd prime satisfies the condition of our new construction. As a consequence, we obtain a new infinite family of strongly regular graphs of Latin square type with non-prime-power number of vertices.
期刊介绍:
Graphs and Combinatorics is an international journal devoted to research concerning all aspects of combinatorial mathematics. In addition to original research papers, the journal also features survey articles from authors invited by the editorial board.