Ruifang Liu

activity

20142023

k

-factors and spanning trees of graphs

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

collaborators

Showing 2023Show all

3 papers · 1 filter

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{…

Sufficient conditions for k-factors and spanning trees of graphs

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

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

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

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