{"title":"Quadratic embedding constants of fan graphs and graph joins","authors":"Wojciech Młotkowski , Nobuaki Obata","doi":"10.1016/j.laa.2025.01.001","DOIUrl":null,"url":null,"abstract":"<div><div>We derive a general formula for the quadratic embedding constant of a graph join <span><math><msub><mrow><mover><mrow><mi>K</mi></mrow><mrow><mo>¯</mo></mrow></mover></mrow><mrow><mi>m</mi></mrow></msub><mo>+</mo><mi>G</mi></math></span>, where <span><math><msub><mrow><mover><mrow><mi>K</mi></mrow><mrow><mo>¯</mo></mrow></mover></mrow><mrow><mi>m</mi></mrow></msub></math></span> is the empty graph on <span><math><mi>m</mi><mo>≥</mo><mn>1</mn></math></span> vertices and <em>G</em> is an arbitrary graph. Applying our formula to a fan graph <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>, where <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>=</mo><msub><mrow><mover><mrow><mi>K</mi></mrow><mrow><mo>¯</mo></mrow></mover></mrow><mrow><mn>1</mn></mrow></msub></math></span> is the singleton graph and <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> is the path on <span><math><mi>n</mi><mo>≥</mo><mn>1</mn></math></span> vertices, we show that <span><math><mrow><mi>QEC</mi></mrow><mo>(</mo><msub><mrow><mi>K</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>+</mo><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo><mo>=</mo><mo>−</mo><msub><mrow><mover><mrow><mi>α</mi></mrow><mrow><mo>˜</mo></mrow></mover></mrow><mrow><mi>n</mi></mrow></msub><mo>−</mo><mn>2</mn></math></span>, where <span><math><msub><mrow><mover><mrow><mi>α</mi></mrow><mrow><mo>˜</mo></mrow></mover></mrow><mrow><mi>n</mi></mrow></msub></math></span> is the minimal zero of a new polynomial <span><math><msub><mrow><mi>Φ</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>(</mo><mi>x</mi><mo>)</mo></math></span> related to Chebyshev polynomials of the second kind. Moreover, for an even <em>n</em> we have <span><math><msub><mrow><mover><mrow><mi>α</mi></mrow><mrow><mo>˜</mo></mrow></mover></mrow><mrow><mi>n</mi></mrow></msub><mo>=</mo><mi>min</mi><mo></mo><mrow><mi>ev</mi></mrow><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math></span>, where the right-hand side is the minimal eigenvalue of the adjacency matrix <span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span> of <span><math><msub><mrow><mi>P</mi></mrow><mrow><mi>n</mi></mrow></msub></math></span>. For an odd <em>n</em> we show that <span><math><mi>min</mi><mo></mo><mrow><mi>ev</mi></mrow><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>)</mo><mo>≤</mo><msub><mrow><mover><mrow><mi>α</mi></mrow><mrow><mo>˜</mo></mrow></mover></mrow><mrow><mi>n</mi></mrow></msub><mo><</mo><mi>min</mi><mo></mo><mrow><mi>ev</mi></mrow><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mi>n</mi></mrow></msub><mo>)</mo></math></span>.</div></div>","PeriodicalId":18043,"journal":{"name":"Linear Algebra and its Applications","volume":"709 ","pages":"Pages 58-91"},"PeriodicalIF":1.0000,"publicationDate":"2025-01-06","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/S0024379525000011","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
We derive a general formula for the quadratic embedding constant of a graph join , where is the empty graph on vertices and G is an arbitrary graph. Applying our formula to a fan graph , where is the singleton graph and is the path on vertices, we show that , where is the minimal zero of a new polynomial related to Chebyshev polynomials of the second kind. Moreover, for an even n we have , where the right-hand side is the minimal eigenvalue of the adjacency matrix of . For an odd n we show that .
期刊介绍:
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.