| Autor: |
JIAHuicai(贾会才) |
| Jazyk: |
čínština |
| Rok vydání: |
2019 |
| Předmět: |
|
| Zdroj: |
Zhejiang Daxue xuebao. Lixue ban, Vol 46, Iss 6, Pp 666-669 (2019) |
| Druh dokumentu: |
article |
| ISSN: |
1008-9497 |
| DOI: |
10.3785/j.issn.1008-9497.2019.06.004 |
| Popis: |
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 kor 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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
