k路覆盖图的新充分条件(New sufficient conditions on k -path-coverable graphs)

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 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.

Keywords

• k-path-coverable
• the distance spectral radius
• the distance signless laplacian spectral radius
• wiener index
• harary index