| k路覆盖图的新充分条件 |
| |
| 引用本文： | 贾会才.k路覆盖图的新充分条件[J].浙江大学学报(理学版),2019,46(6):666-669. |
| |
| 作者姓名： | 贾会才 |
| |
| 作者单位： | 1.河南工程学院 理学院, 河南 郑州 451191
2.中国人民大学 数学学院, 北京 100872 |
| |
| 摘 要： | 设G![]() ![]() 是一个n![]() ![]() 阶简单连通图。如果其顶点集V(G)![]() ![]() 能被k![]() ![]() 条或更少的点不交的路覆盖，则图G![]() ![]() 是k![]() ![]() -路覆盖的。分别用距离谱半径、距离无符号拉普拉斯谱半径、Wiener指数和Harary指数得到了图G![]() ![]() 是k![]() ![]() -路覆盖的新的充分条件。
|
| 关 键 词： | k-路覆盖 距离谱半径 距离无符号拉普拉斯谱半径 Wiener指数 Harary指数 |
New sufficient conditions on k -path-coverable graphs |
| |
| JIA Huicai.New sufficient conditions on k -path-coverable graphs[J].Journal of Zhejiang University(Sciences Edition),2019,46(6):666-669. |
| |
| Authors: | JIA Huicai |
| |
| Institution: | 1.College of Science, Henan University of Engineering, Zhengzhou 451191, China
2.School of Mathematics, Renmin University of China, Beijing 100872, China |
| |
| Abstract: | Let G![]() ![]() be a simple connected graph of order n![]() ![]() . A graph G![]() ![]() is k![]() ![]() -path-coverable if its vertex set V(G)![]() ![]() can be covered by k![]() ![]() or fewer vertex-disjoint paths. In this paper, we give some new sufficient conditions for a graph to be k![]() ![]() -path-coverable in terms of the distance spectral radius, the distance signless Laplacian spectral radius, Wiener index and Harary index of the graph or its complement, respectively. |
| |
| Keywords: | |
|
| 点击此处可从《浙江大学学报(理学版)》浏览原始摘要信息 |
| 点击此处可从《浙江大学学报(理学版)》下载免费的PDF全文 |
