In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get in- equalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0 se c (;) and m Z= 1 let 2 = Z(n ,e, m) (I, = I,(n, e, m)) be the maximal number such that for ev...

The main intention of the present work is to design and evaluate a new Elementary Osmotic Pump (EOP) for efficient delivery of Poorly Water-Soluble Drugs (PWSDs). Drug release from the new system called Expandable EOP (EEOP), is through a porous semipermeable membrane in the form of a suspension ready for dissolution and absorption. EEOP tablets were prepared by compressing the mixture of drug ...

background: rotavirus is one of the most common etiologic agent of severe acute diarrhea in infants and children which results in high mortality and morbidity globally. prophylactic strategies are required to prevent acute rotavirus diarrhea. recently, the beneficial effect of probiotic therapy in control of rotavirus diarrhea was noted in many investigations. this systematic review investigate...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...

let $g=(v,e)$ be a simple graph. a set $dsubseteq v$ is adominating set of $g$ if every vertex in $vsetminus d$ has atleast one neighbor in $d$. the distance $d_g(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$g$. an $(u,v)$-path of length $d_g(u,v)$ is called an$(u,v)$-geodesic. a set $xsubseteq v$ is convex in $g$ ifvertices from all $(a, b)$-geodesics belon...