Let $h$ be a function defined on $E(G)$ with $h(e)\in[0,1]$ for any $e\in E(G)$. Set $d_G^{h}(x)=\sum_{e\ni x}h(e)$. If $g(x)\leq d_G^{h}(x)\leq f(x)$ for every $x\in V(G)$, then we call the graph $F_h$ with vertex set $V(G)$ and edge set $E_h$ a fractional $(g,f)$-factor of $G$ with indicator function $h$, where $E_h=\{e:e\in E(G),h(e)>0\}$. Let $M$ and $N$ be two sets of independent edges of $G$ with $M\cap N=\emptyset$, $|M|=m$ and $|N|=n$. If $G$ admits a fractional $(g,f)$-factor $F_h$ such that $h(e)=1$ for any $e\in M$ and $h(e)=0$ for any $e\in N$, then we say that $G$ has a fractional $(g,f)$-factor with the property $E(m,n)$. In this paper, we present a neighborhood condition for the existence of a fractional $(g,f)$-factor wit...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let G be a graph of order n, and let a and b be two integers with 1 ≤ a ≤ b. Let h : E(G) → [0, 1] b...
AbstractLet G be a graph of order n, and let k≥2 and m≥0 be two integers. Let h:E(G)→[0,1] be a func...
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a functi...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
AbstractThis paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors...
AbstractLet G be a graph, and k a positive integer. Let h:E(G)→[0,1] be a function. If ∑e∋xh(e)=k ho...
AbstractLet G be a graph and f an integer-valued function on V(G). Let h be a function that assigns ...
Abstract–Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k +3- 42(k - 1)2 + 2. Th...
Abstract. Let k be an integer such that k ≥ 1, and let G be a connected graph of order n such that n...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let G be a graph of order n, and let a and b be two integers with 1 ≤ a ≤ b. Let h : E(G) → [0, 1] b...
AbstractLet G be a graph of order n, and let k≥2 and m≥0 be two integers. Let h:E(G)→[0,1] be a func...
Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a functi...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
Let $G$ be a graph of order $n$, and let $a$ and $b$ be two integers with $1\leq a\leq b$. Let $h: E...
AbstractThis paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors...
AbstractLet G be a graph, and k a positive integer. Let h:E(G)→[0,1] be a function. If ∑e∋xh(e)=k ho...
AbstractLet G be a graph and f an integer-valued function on V(G). Let h be a function that assigns ...
Abstract–Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k +3- 42(k - 1)2 + 2. Th...
Abstract. Let k be an integer such that k ≥ 1, and let G be a connected graph of order n such that n...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...
Let $G$ be a graph of order $n$, and let $k\geq1$ be an integer. Let $h: E(G)\rightarrow [0,1]$ be a...