A graph G is called K1 , 5-free if G contains no K1 , 5 as an induced subgraph. A tree with at most m leaves is called an m-ended tree. Let σk(G) denote the minimum degree sum of k independent vertices in G. In this paper, it is shown that every connected K1 , 5-free graph G contains a spanning 5-ended tree if σ6(G) ≥ | G| - 1. © 2019, Malaysian Mathematical Science...
