Non-existence of two infinite families of strongly regular graphs

IF 0.9 3区 数学 Q1 MATHEMATICS European Journal of Combinatorics Pub Date : 2025-05-01 Epub Date: 2025-01-28 DOI:10.1016/j.ejc.2025.104121
Jack H. Koolen , Brhane Gebremichel , Jeong Rye Park , Jongyook Park
{"title":"Non-existence of two infinite families of strongly regular graphs","authors":"Jack H. Koolen ,&nbsp;Brhane Gebremichel ,&nbsp;Jeong Rye Park ,&nbsp;Jongyook Park","doi":"10.1016/j.ejc.2025.104121","DOIUrl":null,"url":null,"abstract":"<div><div>For a positive integer <span><math><mi>t</mi></math></span>, a putative strongly regular graph <span><math><mi>G</mi></math></span> with parameters <span><math><mrow><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>λ</mi><mo>,</mo><mi>μ</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>k</mi><mo>+</mo><mfrac><mrow><mi>k</mi><mrow><mo>(</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>−</mo><mi>λ</mi><mo>)</mo></mrow></mrow><mrow><mi>μ</mi></mrow></mfrac><mo>,</mo><mn>2</mn><mi>t</mi><mrow><mo>(</mo><mn>4</mn><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mi>μ</mi><mo>,</mo><mrow><mo>(</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>32</mn><msup><mrow><mi>t</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mn>4</mn><mi>t</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow><mo>,</mo><mrow><mo>(</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>8</mn><msup><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span> satisfies both the Krein condition and the absolute bound. Also the multiplicities of the eigenvalues of the graph <span><math><mi>G</mi></math></span> are integers. This may mean that such a strongly regular graph exists. However, Koolen and Gebremichel proved that such a strongly regular graph does not exist for <span><math><mrow><mi>t</mi><mo>=</mo><mn>1</mn></mrow></math></span>. In this paper, we generalize their method for all <span><math><mrow><mi>t</mi><mo>≥</mo><mn>1</mn></mrow></math></span> and rule out the infinite family of such strongly regular graphs. In order to do so, we find a restriction on the orders of two large maximal cliques intersecting in many vertices. And we also look at the case where the equality of the claw-bound holds to find an upper bound on the order of a coclique in a local graph (when <span><math><mi>G</mi></math></span> is not Terwilliger). In a similar fashion, we note that one can also rule out another infinite family of putative strongly regular graphs with parameters <span><math><mrow><mrow><mo>(</mo><mi>n</mi><mo>,</mo><mi>k</mi><mo>,</mo><mi>λ</mi><mo>,</mo><mi>μ</mi><mo>)</mo></mrow><mo>=</mo><mrow><mo>(</mo><mn>1</mn><mo>+</mo><mi>k</mi><mo>+</mo><mfrac><mrow><mi>k</mi><mrow><mo>(</mo><mi>k</mi><mo>−</mo><mn>1</mn><mo>−</mo><mi>λ</mi><mo>)</mo></mrow></mrow><mrow><mi>μ</mi></mrow></mfrac><mo>,</mo><mrow><mo>(</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>1</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>4</mn><mi>t</mi><mo>+</mo><mn>3</mn><mo>)</mo></mrow><mi>μ</mi><mo>,</mo><mrow><mo>(</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>32</mn><msup><mrow><mi>t</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><mn>64</mn><msup><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>44</mn><mi>t</mi><mo>+</mo><mn>9</mn><mo>)</mo></mrow><mo>,</mo><mrow><mo>(</mo><mn>2</mn><mi>t</mi><mo>+</mo><mn>2</mn><mo>)</mo></mrow><mrow><mo>(</mo><mn>8</mn><msup><mrow><mi>t</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>12</mn><mi>t</mi><mo>+</mo><mn>5</mn><mo>)</mo></mrow><mo>)</mo></mrow></mrow></math></span>. With the generalized method we are able to rule out two infinite families of putative strongly regular graphs. We are sure that this generalized method can be applied to rule out more putative strongly regular graphs.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"126 ","pages":"Article 104121"},"PeriodicalIF":0.9000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0195669825000034","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/28 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

For a positive integer t, a putative strongly regular graph G with parameters (n,k,λ,μ)=(1+k+k(k1λ)μ,2t(4t+1)μ,(2t+1)(32t3+4t1),(2t+1)(8t2+1)) satisfies both the Krein condition and the absolute bound. Also the multiplicities of the eigenvalues of the graph G are integers. This may mean that such a strongly regular graph exists. However, Koolen and Gebremichel proved that such a strongly regular graph does not exist for t=1. In this paper, we generalize their method for all t1 and rule out the infinite family of such strongly regular graphs. In order to do so, we find a restriction on the orders of two large maximal cliques intersecting in many vertices. And we also look at the case where the equality of the claw-bound holds to find an upper bound on the order of a coclique in a local graph (when G is not Terwilliger). In a similar fashion, we note that one can also rule out another infinite family of putative strongly regular graphs with parameters (n,k,λ,μ)=(1+k+k(k1λ)μ,(2t+1)(4t+3)μ,(2t+2)(32t3+64t2+44t+9),(2t+2)(8t2+12t+5)). With the generalized method we are able to rule out two infinite families of putative strongly regular graphs. We are sure that this generalized method can be applied to rule out more putative strongly regular graphs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
强正则图的两个无限族的不存在性
对于正整数t,具有参数(n,k,λ,μ)=(1+k+k(k−1−λ)μ,2t(4t+1)μ,(2t+1)(32t3+4t−1),(2t+1)(8t2+1))的假定强正则图G既满足Krein条件又满足绝对界。图G的特征值的多重度也是整数。这可能意味着存在这样一个强正则图。然而,Koolen和Gebremichel证明了t=1时不存在这样的强正则图。在本文中,我们对所有t≥1的情况推广了他们的方法,并排除了这类强正则图的无限族。为了做到这一点,我们找到了在多个顶点相交的两个最大团的阶数的限制。我们还研究了爪界成立的情况,以找到局部图中协团阶的上界(当G不是Terwilliger时)。以类似的方式,我们注意到人们也可以排除另一个无限族的假定强正则图,其参数为(n,k,λ,μ)=(1+k+k(k−1−λ)μ,(2t+1)(4t+3)μ,(2t+2)(32t3+64t2+44t+9),(2t+2)(8t2+12t+5))。利用广义方法,我们能够排除两个无限族的假定强正则图。我们确信,这种推广方法可以用来排除更多假定的强正则图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.10
自引率
10.00%
发文量
124
审稿时长
4-8 weeks
期刊介绍: The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
期刊最新文献
On graphs whose Z4-connectivity varies from Z22-connectivity Towards combinatorial characterization of the smoothness of Hessenberg Schubert varieties Snevily conjecture on vector spaces over finite fields The Erdős–Ko–Rado theorem in ℓ2-norm Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1