{"title":"构建参数为 (63,11,8,1,2) 的有向强规则图","authors":"Andries E. Brouwer , Dean Crnković , Andrea Švob","doi":"10.1016/j.disc.2024.114146","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we prove the existence of directed strongly regular graphs with parameters <span><math><mo>(</mo><mn>63</mn><mo>,</mo><mn>11</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>. We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed strongly regular graphs have <span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>8</mn><mo>)</mo><mo>:</mo><mn>3</mn></math></span> as the full automorphism group.</p></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A construction of directed strongly regular graphs with parameters (63,11,8,1,2)\",\"authors\":\"Andries E. Brouwer , Dean Crnković , Andrea Švob\",\"doi\":\"10.1016/j.disc.2024.114146\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we prove the existence of directed strongly regular graphs with parameters <span><math><mo>(</mo><mn>63</mn><mo>,</mo><mn>11</mn><mo>,</mo><mn>8</mn><mo>,</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>)</mo></math></span>. We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed strongly regular graphs have <span><math><msub><mrow><mi>L</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>(</mo><mn>8</mn><mo>)</mo><mo>:</mo><mn>3</mn></math></span> as the full automorphism group.</p></div>\",\"PeriodicalId\":50572,\"journal\":{\"name\":\"Discrete Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2024-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discrete Mathematics\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0012365X24002772\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24002772","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
A construction of directed strongly regular graphs with parameters (63,11,8,1,2)
In this paper, we prove the existence of directed strongly regular graphs with parameters . We construct a pair of nonisomorphic dsrg(63,11,8,1,2), where one is obtained from the other by reversing all arrows. Both directed strongly regular graphs have as the full automorphism group.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.