{"title":"论三角形图的图兰谱问题","authors":"Yi Xu, Xin Li","doi":"10.1016/j.laa.2024.05.015","DOIUrl":null,"url":null,"abstract":"<div><p>In 2010, Nikiforov conjectured that for <span><math><mi>ℓ</mi><mo>≥</mo><mn>2</mn></math></span> and <em>n</em> sufficiently large, <span><math><msubsup><mrow><mi>S</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>ℓ</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>1</mn></mrow></msubsup></math></span> is the unique graph with the maximum spectral radius over all <em>n</em>-vertex <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn><mi>ℓ</mi></mrow></msub></math></span>-free graphs. In 2022, Cioabǎ, Desai and Tait solved this conjecture. The theta graph <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span> consists of two vertices joined by <em>t</em> vertex-disjoint paths, each of length <em>ℓ</em>. Particularly, <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mn>2</mn><mo>,</mo><mi>ℓ</mi></mrow></msub><mo>≅</mo><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn><mi>ℓ</mi></mrow></msub></math></span>. In this paper, we characterize the unique extremal graph which attains the maximum spectral radius among all <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span>-free graphs of order <em>n</em>, where <span><math><mi>t</mi><mo>,</mo><mi>ℓ</mi><mo>≥</mo><mn>3</mn></math></span> and <em>n</em> is sufficiently large.</p></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the spectral Turán problem of theta graphs\",\"authors\":\"Yi Xu, Xin Li\",\"doi\":\"10.1016/j.laa.2024.05.015\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In 2010, Nikiforov conjectured that for <span><math><mi>ℓ</mi><mo>≥</mo><mn>2</mn></math></span> and <em>n</em> sufficiently large, <span><math><msubsup><mrow><mi>S</mi></mrow><mrow><mi>n</mi><mo>,</mo><mi>ℓ</mi><mo>−</mo><mn>1</mn></mrow><mrow><mn>1</mn></mrow></msubsup></math></span> is the unique graph with the maximum spectral radius over all <em>n</em>-vertex <span><math><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn><mi>ℓ</mi></mrow></msub></math></span>-free graphs. In 2022, Cioabǎ, Desai and Tait solved this conjecture. The theta graph <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span> consists of two vertices joined by <em>t</em> vertex-disjoint paths, each of length <em>ℓ</em>. Particularly, <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mn>2</mn><mo>,</mo><mi>ℓ</mi></mrow></msub><mo>≅</mo><msub><mrow><mi>C</mi></mrow><mrow><mn>2</mn><mi>ℓ</mi></mrow></msub></math></span>. In this paper, we characterize the unique extremal graph which attains the maximum spectral radius among all <span><math><msub><mrow><mi>Θ</mi></mrow><mrow><mi>t</mi><mo>,</mo><mi>ℓ</mi></mrow></msub></math></span>-free graphs of order <em>n</em>, where <span><math><mi>t</mi><mo>,</mo><mi>ℓ</mi><mo>≥</mo><mn>3</mn></math></span> and <em>n</em> is sufficiently large.</p></div>\",\"PeriodicalId\":18043,\"journal\":{\"name\":\"Linear Algebra and its Applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Linear Algebra and its Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0024379524002209\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Linear Algebra and its Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0024379524002209","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
摘要
2010 年,尼基福罗夫猜想,对于 ℓ≥2 和 n 足够大的情况,Sn,ℓ-11 是所有 n 顶点无 C2ℓ 图形中具有最大谱半径的唯一图形。2022 年,Cioabǎ、Desai 和 Tait 解决了这一猜想。θ图 Θt,ℓ由两个顶点通过 tx 个顶点相交的路径连接而成,每个路径的长度为 ℓ。特别是,Θ2,ℓ≅C2ℓ。在本文中,我们描述了在 t,ℓ≥3 且 n 足够大的情况下,所有无 Θt,ℓ 的 n 阶图中达到最大谱半径的唯一极值图。
In 2010, Nikiforov conjectured that for and n sufficiently large, is the unique graph with the maximum spectral radius over all n-vertex -free graphs. In 2022, Cioabǎ, Desai and Tait solved this conjecture. The theta graph consists of two vertices joined by t vertex-disjoint paths, each of length ℓ. Particularly, . In this paper, we characterize the unique extremal graph which attains the maximum spectral radius among all -free graphs of order n, where and n is sufficiently large.
期刊介绍:
Linear Algebra and its Applications publishes articles that contribute new information or new insights to matrix theory and finite dimensional linear algebra in their algebraic, arithmetic, combinatorial, geometric, or numerical aspects. It also publishes articles that give significant applications of matrix theory or linear algebra to other branches of mathematics and to other sciences. Articles that provide new information or perspectives on the historical development of matrix theory and linear algebra are also welcome. Expository articles which can serve as an introduction to a subject for workers in related areas and which bring one to the frontiers of research are encouraged. Reviews of books are published occasionally as are conference reports that provide an historical record of major meetings on matrix theory and linear algebra.