Jack H. Koolen , Chenhui Lv , Jongyook Park , Qianqian Yang
{"title":"用 b 限定具有经典参数 (D,b,α,β)的距离规则图的交点数 c2","authors":"Jack H. Koolen , Chenhui Lv , Jongyook Park , Qianqian Yang","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":"348 2","pages":"Article 114239"},"PeriodicalIF":0.7000,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Bounding the intersection number c2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b\",\"authors\":\"Jack H. Koolen , Chenhui Lv , Jongyook Park , Qianqian Yang\",\"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\":\"348 2\",\"pages\":\"Article 114239\"},\"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}","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}
Bounding the intersection number c2 of a distance-regular graph with classical parameters (D,b,α,β) in terms of b
Let Γ be a distance-regular graph with classical parameters and . It is known that Γ is Q-polynomial with respect to , where is the second largest eigenvalue of Γ. And it was shown that for a distance-regular graph Γ with classical parameters , and , if is large enough compared to b and Γ is thin, then the intersection number 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.
期刊介绍:
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.