Bounding the intersection number c2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b

IF 0.7 3区 数学 Q2 MATHEMATICS
{"title":"Bounding the intersection number c2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b","authors":"","doi":"10.1016/j.disc.2024.114239","DOIUrl":null,"url":null,"abstract":"<div><p>Let Γ be a distance-regular graph with classical parameters <span><math><mo>(</mo><mi>D</mi><mo>,</mo><mi>b</mi><mo>,</mo><mi>α</mi><mo>,</mo><mi>β</mi><mo>)</mo></math></span> and <span><math><mi>b</mi><mo>≥</mo><mn>1</mn></math></span>. It is known that Γ is <em>Q</em>-polynomial with respect to <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>, where <span><math><msub><mrow><mi>θ</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><mfrac><mrow><msub><mrow><mi>b</mi></mrow><mrow><mn>1</mn></mrow></msub></mrow><mrow><mi>b</mi></mrow></mfrac><mo>−</mo><mn>1</mn></math></span> is the second largest eigenvalue of Γ. And it was shown that for a distance-regular graph Γ with classical parameters <span><math><mo>(</mo><mi>D</mi><mo>,</mo><mi>b</mi><mo>,</mo><mi>α</mi><mo>,</mo><mi>β</mi><mo>)</mo></math></span>, <span><math><mi>D</mi><mo>≥</mo><mn>5</mn></math></span> and <span><math><mi>b</mi><mo>≥</mo><mn>1</mn></math></span>, if <span><math><msub><mrow><mi>a</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> is large enough compared to <em>b</em> and Γ is thin, then the intersection number <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> of Γ is bounded above by a function of <em>b</em>. In this paper, we obtain a similar result without the assumption that the graph Γ is thin.</p></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-09-11","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/S0012365X24003704","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Let Γ be a distance-regular graph with classical parameters (D,b,α,β) and b1. It is known that Γ is Q-polynomial with respect to θ1, where θ1=b1b1 is the second largest eigenvalue of Γ. And it was shown that for a distance-regular graph Γ with classical parameters (D,b,α,β), D5 and b1, if a1 is large enough compared to b and Γ is thin, then the intersection number c2 of Γ is bounded above by a function of b. In this paper, we obtain a similar result without the assumption that the graph Γ is thin.

用 b 限定具有经典参数 (D,b,α,β)的距离规则图的交点数 c2
设 Γ 是一个距离规则图,其经典参数为 (D,b,α,β),且 b≥1 已知 Γ 关于 θ1 是 Q 多项式,其中 θ1=b1b-1 是 Γ 的第二大特征值。本文在不假设图 Γ 很薄的情况下也得到了类似的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信