Skip to Content
AxiomsAxioms
  • Article
  • Open Access

23 April 2023

25 Pages

Spanning k-Ended Tree in 2-Connected Graph

and
1
School of Mathematics and Statistics, Taiyuan Normal University, Jinzhong 030619, China
2
School of Computer Science, Qinghai Normal University, Xining 810008, China
*
Author to whom correspondence should be addressed.

Abstract

Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves. In this paper, we strengthen the Win theorem to the following: Let G be a simple 2-connected graph such that |V(G)|≥2κ(G)+k, α(G)≤κ(G)+k(k≥2) and the number of maximum independent sets of cardinality κ+k is at most n−2κ−k+1. Then, either G contains a spanning k-ended tree or a subgraph of Kκ∨((k+κ−1)K1∪Kn−2κ−k+1).

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.