نتایج جستجو برای: fractional $(k
تعداد نتایج: 435041 فیلتر نتایج به سال:
Fej'{e}r Hadamard inequality is generalization of Hadamard inequality. In this paper we prove certain Fej'{e}r Hadamard inequalities for $k$-fractional integrals. We deduce Fej'{e}r Hadamard-type inequalities for Riemann-Liouville fractional integrals. Also as special case Hadamard inequalities for $k$-fractional as well as fractional integrals are given.
for any $k in mathbb{n}$, the $k$-subdivision of graph $g$ is a simple graph $g^{frac{1}{k}}$, which is constructed by replacing each edge of $g$ with a path of length $k$. in [moharram n. iradmusa, on colorings of graph fractional powers, discrete math., (310) 2010, no. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $g$ has been introduced as a fractional power of $g$, denoted by ...
For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...
In this paper we will prove certain Hadamard and Fejer-Hadamard inequalities for the functions whose nth derivatives are convex by using Caputo k-fractional derivatives. These results have some relationship with inequalities for Caputo fractional derivatives.
a graph $g$ is called a fractional $(k,n',m)$-critical deleted graph if any $n'$ vertices are removed from $g$ the resulting graph is a fractional $(k,m)$-deleted graph. in this paper, we prove that for integers $kge 2$, $n',mge0$, $nge8k+n'+4m-7$, and $delta(g)ge k+n'+m$, if $$|n_{g}(x)cup n_{g}(y)|gefrac{n+n'}{2}$$ for each pair of non-adjac...
A graph G is fractional k-covered if for each edge e of G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2, then a fractional k-covered graph is called a fractional 2-covered graph. The binding number bind(G) is defined as follows, bind(G) = min{ |NG(X)| |X| : Ø = X ⊆ V (G), NG(X) = V (G)}. In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4 and bind(G) > 5...
In this paper, we derive a novel numerical method to find out the numerical solution of fractional partial differential equations (PDEs) involving Caputo-Fabrizio (C-F) fractional derivatives. We first find out the approximation formula of C-F derivative of function tk. We approximate the C-F derivative in time with the help of the Legendre spectral method and approximation formula o...
The main objective of this paper is to introduce k-fractional derivative operator by using the definition of k-beta function. We establish some results related to the newly defined fractional operator such as Mellin transform and relations to khypergeometric and k-Appell’s functions. Also, we investigate the k-fractional derivative of k-Mittag-Leffler and Wright hypergeometric functions.
We say that a simple graph G is fractional independent-set-deletable k-factor-critical, shortly, fractional ID-k-factor-critical, if G− I has a fractional k-factor for every independent set I of G. Some sufficient conditions for a graph to be fractional ID-k-factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense. 2010 Mathematics Subject C...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید