André Ebling Brondani, Carla Silva Oliveira, Francisca Andrea Macedo França, Leonardo de Lima
{"title":"Aα-Spectrum of a Firefly Graph","authors":"André Ebling Brondani, Carla Silva Oliveira, Francisca Andrea Macedo França, Leonardo de Lima","doi":"10.1016/j.entcs.2019.08.019","DOIUrl":null,"url":null,"abstract":"<div><p>Let <em>G</em> be a connected graph of order <em>n</em>, <em>A</em>(<em>G</em>) is the adjacency matrix of <em>G</em> and <em>D</em>(<em>G</em>) is the diagonal matrix of the row-sums of <em>A</em>(<em>G</em>). In 2017, Nikiforov [Nikiforov, V., <em>Merging the A- and Q-Spectral Theories</em>, Applicable Analysis and Discrete Mathematics <strong>11</strong> (2017), pp. 81–107.] defined the convex linear combinations <em>A</em><sub><em>α</em></sub>(<em>G</em>) of <em>A</em>(<em>G</em>) and <em>D</em>(<em>G</em>) by<span><span><span><math><msub><mrow><mi>A</mi></mrow><mrow><mi>α</mi></mrow></msub><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>α</mi><mi>D</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>+</mo><mo>(</mo><mn>1</mn><mo>−</mo><mi>α</mi><mo>)</mo><mi>A</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>,</mo><mspace></mspace><mn>0</mn><mo>≤</mo><mi>α</mi><mo>≤</mo><mn>1</mn><mo>.</mo></math></span></span></span> In this paper, we obtain a partial factorization of the <em>A</em><sub><em>α</em></sub>-characteristic polynomial of the firefly graph which explicitly gives some eigenvalues of the graph.</p></div>","PeriodicalId":38770,"journal":{"name":"Electronic Notes in Theoretical Computer Science","volume":"346 ","pages":"Pages 209-219"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.entcs.2019.08.019","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Notes in Theoretical Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1571066119300696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 6
Abstract
Let G be a connected graph of order n, A(G) is the adjacency matrix of G and D(G) is the diagonal matrix of the row-sums of A(G). In 2017, Nikiforov [Nikiforov, V., Merging the A- and Q-Spectral Theories, Applicable Analysis and Discrete Mathematics 11 (2017), pp. 81–107.] defined the convex linear combinations Aα(G) of A(G) and D(G) by In this paper, we obtain a partial factorization of the Aα-characteristic polynomial of the firefly graph which explicitly gives some eigenvalues of the graph.
期刊介绍:
ENTCS is a venue for the rapid electronic publication of the proceedings of conferences, of lecture notes, monographs and other similar material for which quick publication and the availability on the electronic media is appropriate. Organizers of conferences whose proceedings appear in ENTCS, and authors of other material appearing as a volume in the series are allowed to make hard copies of the relevant volume for limited distribution. For example, conference proceedings may be distributed to participants at the meeting, and lecture notes can be distributed to those taking a course based on the material in the volume.