A tight Q-index condition for a graph to be k-path-coverable involving minimum degree

2021/09/15 by Tao Cheng, Lihua Feng, Cheng, Tao +5
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2109.07347

Abstract

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, using the Q-index of a connected graph G, we present a tight sufficient condition for G with fixed minimum degree and large order to be k-path-coverable.

Related

• The k-path vertex cover: general bounds and chordal graphs
• Spectral conditions of complement for some graphical properties
• A Survey on the k-Path Vertex Cover Problem
• Degree conditions for disjoint path covers in digraphs
• The Q-index and connectivity of graphs