On the maximum $$A_{\alpha }$$ -spectral radius of unicyclic and bicyclic graphs with fixed girth or fixed number of pendant vertices

Joyentanuj Das, Iswar Mahato
{"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}
引用次数: 0

Abstract

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

$$\begin{aligned} A_\alpha (G) = \alpha D(G) + (1-\alpha ) A(G) \quad \text {for any }\alpha \in [0,1]. \end{aligned}$$

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.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于具有固定周长或固定垂顶数量的单环和双环图的最大 $$A_{\alpha }$ - 谱半径
对于连通图 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 }\)- 谱半径的唯一图形。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
11.50%
发文量
352
期刊介绍: 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.
期刊最新文献
Two efficient nonlinear conjugate gradient methods for Riemannian manifolds A new algorithm for approximating solutions of the common variational inclusion On some extension of Traub–Steffensen type methods in Banach spaces Neighbourhood and competition graphs under fuzzy incidence graph and its application Chebyshev polynomial derivative-based spectral tau approach for solving high-order differential equations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1