Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs

IF 0.3 Q4 COMPUTER SCIENCE, THEORY & METHODS Acta Universitatis Sapientiae Informatica Pub Date : 2022-12-01 DOI:10.2478/ausi-2022-0011
S. Bhatnagar, Merajuddin, S. Pirzada
{"title":"Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs","authors":"S. Bhatnagar, Merajuddin, S. Pirzada","doi":"10.2478/ausi-2022-0011","DOIUrl":null,"url":null,"abstract":"Abstract Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively. Let the vertex degree sequence be d1 ≥ d2 ≥··· ≥ dn and let μ1 ≥ μ2 ≥··· ≥ μn−1 >μn = 0 be the eigenvalues of the Laplacian matrix of G. The graph invariants, Laplacian energy (LE), the Laplacian-energy-like invariant (LEL) and the Kirchhoff index (Kf), are defined in terms of the Laplacian eigenvalues of graph G, as LE=∑i=1n| μi-2mn | LE = \\sum\\nolimits_{i = 1}^n {\\left| {{\\mu _i} - {{2m} \\over n}} \\right|} , LEL=∑i=1n-1μi LEL = \\sum\\nolimits_{i = 1}^{n - 1} {\\sqrt {{\\mu _i}} } and Kf=n∑i=1n-11μi Kf = n\\sum\\nolimits_{i = 1}^{n - 1} {{1 \\over {{\\mu _i}}}} respectively. In this paper, we obtain a new bound for the Laplacian-energy-like invariant LEL and establish the relations between Laplacian-energy-like invariant LEL and the Kirchhoff index Kf.Further,weobtain the relations between the Laplacian energy LE and Kirchhoff index Kf.","PeriodicalId":41480,"journal":{"name":"Acta Universitatis Sapientiae Informatica","volume":"49 1","pages":"185 - 198"},"PeriodicalIF":0.3000,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Universitatis Sapientiae Informatica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/ausi-2022-0011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively. Let the vertex degree sequence be d1 ≥ d2 ≥··· ≥ dn and let μ1 ≥ μ2 ≥··· ≥ μn−1 >μn = 0 be the eigenvalues of the Laplacian matrix of G. The graph invariants, Laplacian energy (LE), the Laplacian-energy-like invariant (LEL) and the Kirchhoff index (Kf), are defined in terms of the Laplacian eigenvalues of graph G, as LE=∑i=1n| μi-2mn | LE = \sum\nolimits_{i = 1}^n {\left| {{\mu _i} - {{2m} \over n}} \right|} , LEL=∑i=1n-1μi LEL = \sum\nolimits_{i = 1}^{n - 1} {\sqrt {{\mu _i}} } and Kf=n∑i=1n-11μi Kf = n\sum\nolimits_{i = 1}^{n - 1} {{1 \over {{\mu _i}}}} respectively. In this paper, we obtain a new bound for the Laplacian-energy-like invariant LEL and establish the relations between Laplacian-energy-like invariant LEL and the Kirchhoff index Kf.Further,weobtain the relations between the Laplacian energy LE and Kirchhoff index Kf.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
计算图的拉普拉斯能量、类拉普拉斯能量不变量和Kirchhoff指数
设G是一个n阶、大小为m的简单连通图,矩阵L(G)= D(G)−a (G)称为图G的拉普拉斯矩阵,其中D(G)和a (G)分别是度对角矩阵和邻接矩阵。设顶点度序列d1≥d2≥····dn,设μ1≥μ2≥···≥μn - 1 >μn = 0为G的拉普拉斯矩阵的特征值。图的不变量、拉普拉斯能量(LE)、类拉普拉斯能量不变量(LEL)和Kirchhoff指数(Kf)根据图G的拉普拉斯特征值定义为:LE=∑i=1n| μi-2mn | LE= \sum\nolimits _i =1{ ^n }{\left | {{\mu _i }-{{2m }\over n }}\right |;}LEL=∑i=1n-1μi LEL=\sum\nolimits _i =1{ ^}n -1{}{\sqrt{{\mu _i}}和Kf=n∑i=1n-11μi Kf=n }\sum\nolimits _i =1{ ^}n -{1}{{\over{{\mu _i}}}}。本文给出了类拉普拉斯能不变量LEL的一个新的界,建立了类拉普拉斯能不变量LEL与Kirchhoff指数Kf之间的关系。进一步,我们得到了拉普拉斯能量LE与基尔霍夫指数Kf之间的关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Acta Universitatis Sapientiae Informatica
Acta Universitatis Sapientiae Informatica COMPUTER SCIENCE, THEORY & METHODS-
自引率
0.00%
发文量
9
期刊最新文献
E-super arithmetic graceful labelling of Hi(m, m), Hi(1) (m, m) and chain of even cycles On agglomeration-based rupture degree in networks and a heuristic algorithm On domination in signed graphs Connected certified domination edge critical and stable graphs Eccentric connectivity index in transformation graph Gxy+
×
引用
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