{"title":"关于具有固定周长或固定垂顶数量的单环和双环图的最大 $$A_{\\alpha }$ - 谱半径","authors":"Joyentanuj Das, Iswar Mahato","doi":"10.1007/s40314-024-02856-7","DOIUrl":null,"url":null,"abstract":"<p>For a connected graph <i>G</i>, let <i>A</i>(<i>G</i>) be the adjacency matrix of <i>G</i> and <i>D</i>(<i>G</i>) be the diagonal matrix of the degrees of the vertices in <i>G</i>. The <span>\\(A_{\\alpha }\\)</span>-matrix of <i>G</i> is defined as </p><span>$$\\begin{aligned} A_\\alpha (G) = \\alpha D(G) + (1-\\alpha ) A(G) \\quad \\text {for any }\\alpha \\in [0,1]. \\end{aligned}$$</span><p>The largest eigenvalue of <span>\\(A_{\\alpha }(G)\\)</span> is called the <span>\\(A_{\\alpha }\\)</span>-spectral radius of <i>G</i>. In this article, we characterize the graphs with maximum <span>\\(A_{\\alpha }\\)</span>-spectral radius among the class of unicyclic and bicyclic graphs of order <i>n</i> with fixed girth <i>g</i>. Also, we identify the unique graphs with maximum <span>\\(A_{\\alpha }\\)</span>-spectral radius among the class of unicyclic and bicyclic graphs of order <i>n</i> with <i>k</i> pendant vertices.\n</p>","PeriodicalId":51278,"journal":{"name":"Computational and Applied Mathematics","volume":"67 1","pages":""},"PeriodicalIF":2.6000,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the maximum $$A_{\\\\alpha }$$ -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices\",\"authors\":\"Joyentanuj Das, Iswar Mahato\",\"doi\":\"10.1007/s40314-024-02856-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>For a connected graph <i>G</i>, let <i>A</i>(<i>G</i>) be the adjacency matrix of <i>G</i> and <i>D</i>(<i>G</i>) be the diagonal matrix of the degrees of the vertices in <i>G</i>. The <span>\\\\(A_{\\\\alpha }\\\\)</span>-matrix of <i>G</i> is defined as </p><span>$$\\\\begin{aligned} A_\\\\alpha (G) = \\\\alpha D(G) + (1-\\\\alpha ) A(G) \\\\quad \\\\text {for any }\\\\alpha \\\\in [0,1]. \\\\end{aligned}$$</span><p>The largest eigenvalue of <span>\\\\(A_{\\\\alpha }(G)\\\\)</span> is called the <span>\\\\(A_{\\\\alpha }\\\\)</span>-spectral radius of <i>G</i>. In this article, we characterize the graphs with maximum <span>\\\\(A_{\\\\alpha }\\\\)</span>-spectral radius among the class of unicyclic and bicyclic graphs of order <i>n</i> with fixed girth <i>g</i>. Also, we identify the unique graphs with maximum <span>\\\\(A_{\\\\alpha }\\\\)</span>-spectral radius among the class of unicyclic and bicyclic graphs of order <i>n</i> with <i>k</i> pendant vertices.\\n</p>\",\"PeriodicalId\":51278,\"journal\":{\"name\":\"Computational and Applied Mathematics\",\"volume\":\"67 1\",\"pages\":\"\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2024-07-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computational and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s40314-024-02856-7\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computational and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s40314-024-02856-7","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
对于连通图 G,让 A(G) 是 G 的邻接矩阵,D(G) 是 G 中顶点度数的对角矩阵。A_\alpha (G) = \alpha D(G) + (1-\alpha ) A(G) \quad \text {for any }\alpha \ in [0,1].\end{aligned}$$ \(A_{\alpha }(G)\) 的最大特征值叫做 G 的 \(A_{\alpha }\)-spectral radius。此外,我们还确定了在具有 k 个垂顶的 n 阶单环图和双环图中具有最大 \(A_{\alpha }\)- 谱半径的唯一图形。
On the maximum $$A_{\alpha }$$ -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices
For a connected graph G, let A(G) be the adjacency matrix of G and D(G) be the diagonal matrix of the degrees of the vertices in G. The \(A_{\alpha }\)-matrix of G is defined as
The largest eigenvalue of \(A_{\alpha }(G)\) is called the \(A_{\alpha }\)-spectral radius of G. In this article, we characterize the graphs with maximum \(A_{\alpha }\)-spectral radius among the class of unicyclic and bicyclic graphs of order n with fixed girth g. Also, we identify the unique graphs with maximum \(A_{\alpha }\)-spectral radius among the class of unicyclic and bicyclic graphs of order n with k pendant vertices.
期刊介绍:
Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics).
The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.