A note on spanning trees of connected $K_{1,t}$-free graphs whose stems have a few leaves

TL;DR

This paper establishes a precise condition under which connected $K_{1,t}$-free graphs contain spanning trees with stems having few leaves, improving upon existing results in the field.

Contribution

It provides a sharp sufficient condition for the existence of such spanning trees in $K_{1,t}$-free graphs, advancing previous research.

Findings

Derived a sharp sufficient condition for spanning trees with few leaves in stems

Improved upon previous related results in the literature

Applied the main theorem to specific classes of graphs

Abstract

Let $T$ be a tree, a vertex of degree one is called a leaf. The set of leaves of $T$ is denoted by $Leaf(T)$. The subtree $T-Leaf(T)$ of $T$ is called the stem of $T$ and denoted by $Stem(T).$ In this note, we give a sharp sufficient condition to show that a $K_{1,t}-$free graph has a spanning tree whose stem has a few leaves. By applying the main result, we give improvements of previous related results.