IR
The generalized path matrix and energy
Lu, Pengli; Luan, Rui
2023-02
发表期刊DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
ISSN1793-8309
卷号15期号:2
摘要We define the path Laplacian matrix and the path signless Laplacian matrix of a simple connected graph G as P-L (G) = Tr-P (G) - P(G) and P-Q (G) = Tr-P (G) + P(G), respectively, where P(G) is the path matrix and Tr-P (G) is the diagonal matrix of the vertex transmissions. The generalized path matrix is P-alpha(G) = alpha Tr-P (G) + (1 - alpha)P(G), for 0 <= alpha <= 1 and rho(alpha)(1) >= rho(alpha)(2) >= ... >= rho(alpha)(n) are the eigenvalues of P-alpha(G). The generalized path energy can be expressed as E-P alpha (G) = Sigma(n)(i=1) vertical bar rho(alpha)(i) - 2 alpha PW(G)/n vertical bar, where PW(G) is the path Wiener index of G. We give basic properties of generalized path matrix P-alpha(G). Also, some upper and lower bounds of the generalized path energy of some graphs are studied.
关键词Generalized path matrix path matrix generalized path energy spectral radius transmission regular graph
DOI10.1142/S1793830922500719
收录类别ESCI
语种英语
WOS研究方向Mathematics
WOS类目Mathematics, Applied
WOS记录号WOS:000848620100001
出版者WORLD SCIENTIFIC PUBL CO PTE LTD
来源库WOS
引用统计
文献类型期刊论文
条目标识符https://ir.lut.edu.cn/handle/2XXMBERH/159868
专题兰州理工大学
通讯作者Lu, Pengli
作者单位Lanzhou Univ Technol, Sch Comp & Commun, Lanzhou 730050, Gansu, Peoples R China
第一作者单位兰州理工大学
通讯作者单位兰州理工大学
第一作者的第一单位兰州理工大学
推荐引用方式
GB/T 7714
Lu, Pengli,Luan, Rui. The generalized path matrix and energy[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS,2023,15(2).
APA Lu, Pengli,&Luan, Rui.(2023).The generalized path matrix and energy.DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS,15(2).
MLA Lu, Pengli,et al."The generalized path matrix and energy".DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS 15.2(2023).
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Lu, Pengli]的文章
[Luan, Rui]的文章
百度学术
百度学术中相似的文章
[Lu, Pengli]的文章
[Luan, Rui]的文章
必应学术
必应学术中相似的文章
[Lu, Pengli]的文章
[Luan, Rui]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。