Guo-Yan Ao

activity

20222025

k

-factors and spanning trees of graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing 2022Show all

2 papers · 1 filter

math.CO2022

Spectral radius and spanning trees of graphs

Guoyan Ao, Ruifang Liu, Jinjiang Yuan

For integer $k \geq 2,$ a spanning $k$ -ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilt…

math.CO2022

An improvement of sufficient condition for $k$ -leaf-connected graphs

Tingyan Ma, Guoyan Ao, Ruifang Liu +2

For integer $k \geq 2,$ a graph $G$ is called $k$ -leaf-connected if $∣ V (G) ∣ \geq k + 1$ and given any subset $S \subseteq V (G)$ with $∣ S ∣ = k,$ $G$ always has a spanning tree $T$ such that…

Spectral radius and spanning trees of graphs

An improvement of sufficient condition for k-leaf-connected graphs

An improvement of sufficient condition for $k$ -leaf-connected graphs