{"title":"The signless Laplacian spectral radius of book-free graphs","authors":"Ming-Zhu Chen , Ya-Lei Jin , Peng-Li Zhang","doi":"10.1016/j.disc.2025.114448","DOIUrl":null,"url":null,"abstract":"<div><div>Given a graph <em>H</em>, a graph is called <em>H</em>-free if it does not contain <em>H</em> as a subgraph. For a positive integer <em>k</em>, a book <span><math><msub><mrow><mi>B</mi></mrow><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span> is a graph consisting of <span><math><mi>k</mi><mo>+</mo><mn>1</mn></math></span> triangles sharing a common edge. In this paper, let <em>G</em> be a <span><math><msub><mrow><mi>B</mi></mrow><mrow><mi>k</mi><mo>+</mo><mn>1</mn></mrow></msub></math></span>-free graph of order <span><math><mi>n</mi><mo>≥</mo><mn>49</mn><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>−</mo><mn>22</mn><mi>k</mi><mo>+</mo><mn>4</mn></math></span>. Then the signless Laplacian spectral radius <span><math><mi>q</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>≤</mo><mfrac><mrow><mi>n</mi><mo>+</mo><mn>2</mn><mi>k</mi><mo>+</mo><msqrt><mrow><msup><mrow><mo>(</mo><mi>n</mi><mo>−</mo><mn>2</mn><mi>k</mi><mo>)</mo></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>8</mn><msup><mrow><mi>k</mi></mrow><mrow><mn>2</mn></mrow></msup></mrow></msqrt></mrow><mrow><mn>2</mn></mrow></mfrac></math></span> with equality if and only if <span><math><mi>G</mi><mo>=</mo><msub><mrow><mover><mrow><mi>K</mi></mrow><mo>‾</mo></mover></mrow><mrow><mi>k</mi></mrow></msub><mo>∨</mo><mi>H</mi></math></span>, where <em>k</em> or <span><math><mi>n</mi><mo>−</mo><mi>k</mi></math></span> is even, and <em>H</em> is a <span><math><msub><mrow><mi>K</mi></mrow><mrow><mn>3</mn></mrow></msub></math></span>-free <em>k</em>-regular graph of order <span><math><mi>n</mi><mo>−</mo><mi>k</mi></math></span>. Furthermore, if <em>k</em> and <span><math><mi>n</mi><mo>−</mo><mi>k</mi></math></span> are both odd, the extremal graphs with the maximum signless Laplacian spectral radius are also characterized.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 7","pages":"Article 114448"},"PeriodicalIF":0.7000,"publicationDate":"2025-02-21","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/S0012365X25000561","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Given a graph H, a graph is called H-free if it does not contain H as a subgraph. For a positive integer k, a book is a graph consisting of triangles sharing a common edge. In this paper, let G be a -free graph of order . Then the signless Laplacian spectral radius with equality if and only if , where k or is even, and H is a -free k-regular graph of order . Furthermore, if k and are both odd, the extremal graphs with the maximum signless Laplacian spectral radius are also characterized.
期刊介绍:
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.