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

6 papers

math.SP2025

Sufficient conditions of $k$ -leaf-connected graphs and spanning trees with bounded total $k$ -excess

Guoyan Ao, Ruifang Liu, Jinjiang Yuan

Chvátal and Erdös [Discrete Math. 2 (1972) 111-113] stated that, for an $m$ -connected graph $G$ , if its independence number $α (G) \leq m - 1$ , then $G$ is Hamilton-connected. Note tha…

math.CO2023★ 1 cited

Sufficient conditions for $k$ -factors and spanning trees of graphs

Guoyan Ao, Ruifang Liu, Jinjiang Yuan +2

For any integer $k \geq 1,$ a graph $G$ has a $k$ -factor if it contains a $k$ -regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of $r$ -c…

math.CO2023

Spectral radius, fractional $[a, b]$ -factor and ID-factor-critical graphs

Ao Fan, Ruifang Liu, Guoyan Ao

Let $G$ be a graph and $h : E (G) \to [0, 1]$ be a function. For any two positive integers $a$ and $b$ with $a \leq b$ , a fractional $[a, b]$ -factor of $G$ with the indicator fun…

math.CO2023

Fractional matching, factors and spectral radius in graphs involving minimum degree

Jing Lou, Ruifang Liu, Guoyan Ao

A fractional matching of a graph $G$ is a function $f : E (G) \to [0, 1]$ such that for any $v \in V (G)$ , $\sum_{e \in E_{G} (v)} f (e) \leq 1$ , where $E_{G}(v)=\{e\in E(G): e~ \mbox{…

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…

Sufficient conditions of k-leaf-connected graphs and spanning trees with bounded total k-excess

Sufficient conditions for k-factors and spanning trees of graphs

Spectral radius, fractional [a,b]-factor and ID-factor-critical graphs