图的路(无符号)拉普拉斯谱半径及其能量  

On path(signless)Laplacian spectral radius and energy of graphs

作　　者：卢鹏丽[1] 栾睿 郭育红 LU Peng-li;LUAN Rui;GUO Yu-hong(School of Computer and Communication,Lanzhou University of Technology,Lanzhou,730050,Gansu,China;School of Mathematics and Statistics,Hexi University,Zhangye,734000,Gansu,China)

机构地区：[1]兰州理工大学计算机与通信学院,甘肃兰州730050 [2]河西学院数学与统计学院,甘肃张掖734000

出　　处：《山东大学学报（理学版）》2022年第7期14-21,共8页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(11861045,62162040)。

摘　　要：图G的顶点集V(G)={v_(1),v_(2),…,v_(n)},其路矩阵记为P(G)=(p_(ij))_(n×n),p_(ij)表示图中v_(i),v_(j)之间内部顶点不相交路径的最大数目。定义路拉普拉斯矩阵和路无符号拉普拉斯矩阵并得到了其谱半径和能量的界。Given a graph G with vertex set V(G)={v_(1),v_(2),…,v_(n)},a path matrix associate to G is P(G)=(p_(ij))_(n×n),p_(ij)is the maximum number of interior vertex disjoint paths.The path Laplacian matrix and path signless Laplacian matrix of a connected graph is defined and the bounds of the spectral radius and energy is obtained.

关 键 词：路矩阵 路拉普拉斯矩阵 路无符号拉普拉斯矩阵 谱半径 能量 

分 类 号：O157.5[理学—数学] O157.6[理学—基础数学]