1 citations · 1 across the 5 of their papers we have counts for
5 papers · 1 filter
Sufficient conditions for -factors and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan +2
For any integer a graph has a -factor if it contains a -regular spanning subgraph. In this paper we prove a sufficient condition in terms of the number of -c…
Spectral radius, fractional -factor and ID-factor-critical graphs
Ao Fan, Ruifang Liu, Guoyan Ao
Let be a graph and be a function. For any two positive integers and with , a fractional -factor of with the indicator fun…
Fractional matching, factors and spectral radius in graphs involving minimum degree
Jing Lou, Ruifang Liu, Guoyan Ao
A fractional matching of a graph is a function such that for any , , where $E_{G}(v)=\{e\in E(G): e~ \mbox{…
Spectral radius and spanning trees of graphs
Guoyan Ao, Ruifang Liu, Jinjiang Yuan
For integer a spanning -ended-tree is a spanning tree with at most leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilt…
An improvement of sufficient condition for -leaf-connected graphs
Tingyan Ma, Guoyan Ao, Ruifang Liu +2
For integer a graph is called -leaf-connected if and given any subset with always has a spanning tree such that…