| 图的路(无符号)拉普拉斯谱半径及其能量 |
| |
| 引用本文： | 卢鹏丽,栾睿,郭育红.图的路(无符号)拉普拉斯谱半径及其能量[J].山东大学学报(理学版),2022,57(7):14-21. |
| |
| 作者姓名： | 卢鹏丽 栾睿 郭育红 |
| |
| 作者单位： | 1.兰州理工大学计算机与通信学院, 甘肃 兰州 730050;2.河西学院数学与统计学院, 甘肃 张掖 734000 |
| |
| 基金项目： | 国家自然科学基金资助项目(11861045,62162040) |
| |
| 摘 要： | 图G的顶点集V(G)={v1,v2,…,vn},其路矩阵记为P(G)=(pij)n×n,pij表示图中vi,vj之间内部顶点不相交路径的最大数目。定义路拉普拉斯矩阵和路无符号拉普拉斯矩阵并得到了其谱半径和能量的界。
|
| 关 键 词： | 路矩阵 路拉普拉斯矩阵 路无符号拉普拉斯矩阵 谱半径 能量 |
On path(signless)Laplacian spectral radius and energy of graphs |
| |
| LU Peng-li,LUAN Rui,GUO Yu-hong.On path(signless)Laplacian spectral radius and energy of graphs[J].Journal of Shandong University,2022,57(7):14-21. |
| |
| Authors: | LU Peng-li LUAN Rui GUO Yu-hong |
| |
| Institution: | 1. School of Computer and Communication, Lanzhou University of Technology, Lanzhou, 730050, Gansu, China;2. School of Mathematics and Statistics, Hexi University, Zhangye, 734000, Gansu, China |
| |
| Abstract: | Given a graph G with vertex set V(G)={v1,v2,…,vn}, a path matrix associate to G is P(G)=(pij)n×n, pij 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. |
| |
| Keywords: | path matrix path Laplacian matrix path signless Laplacian matrix spectral radius energy |
|
| 点击此处可从《山东大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《山东大学学报(理学版)》下载免费的PDF全文 |
|
