【作者单位】1School of Mathematics and Statistics, Taiyuan Normal University, Jinzhong 030619, China;2School of Computer Science, Qinghai Normal University, Xining 810008, China
【年份】2023
【卷号】Vol.12 No.411
【页码】411
【关键词】connectivity independence number k-ended tree maximum independent set
【摘要】 Win proved a very famous conclusion that states the graph G with connectivity κ, independence number α and α≤κ+k−1 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 ...
