نتایج جستجو برای: trapezoid inequality
تعداد نتایج: 58225 فیلتر نتایج به سال:
Abstract In this paper, we explore a class of Hermite–Hadamard integral inequalities for convex and m -convex functions. The Hölder inequality is used to create class, which has wide range applications in optimization theory. Some trapezoid-type midpoint error estimates are investigated. Inequalities several q -special functions highlighted. As particular cases, have included previous results.
Abstract. In this paper we show the nonequivalence of combinations of several natural geometric restrictions on trapezoid representations of trapezoid orders. Each of the properties unit parallelogram, unit trapezoid and proper parallelogram, unit trapezoid and parallelogram, unit trapezoid, proper parallelogram, proper trapezoid and parallelogram, proper trapezoid, parallelogram, and trapezoid...
Along with the direction that generalizes interval graphs and permutation graphs to trapezoid graphs, researchers are now trying to generalize the class known as trapezoid graphs. A circle trapezoid is the region in a circle that lies between two non-crossing chords; thus, circle trapezoid graphs are the intersecting graphs of circle trapezoids within a circle. It should be noted that circle tr...
In the present work, we introduce two new local fractional integral operators involving Mittag–Leffler kernel on Yang’s fractal sets. Then, study related generalized Hermite–Hadamard-type inequality using (E,h)-convexity and obtain identities pertaining to these operators, respective first- second-order derivatives are given. terms of applications, provide some trapezoid-type inequalities for (...
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan et al. [3]. They propose an 0(n2) algorithm for chromatic number and a less efficient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, i.e., O(n log ...
Some sharp trapezoid and midpoint type inequalities for Lipschitzian bifunctions defined on a closed disk in Euclidean sense are obtained by the use of polar coordinates. Also, whose partial derivative is considered. A new presentation Hermite-Hadamard inequality convex function its reverse given. Furthermore, two mappings H <mf...
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. They propose an O(n 2) algorithm for chromatic number and a less eecient algorithm for maximum clique on trapezoid graphs. Based on a geometric representation of trapezoid graphs by boxes in the plane we design optimal, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید