نتایج جستجو برای: frank lead

تعداد نتایج: 350086  

2013
Luke Schaeffer

We show that the local period at position n in a characteristic Sturmian word can be given in terms of the Ostrowski representation for n+ 1.

Journal: :Computers & Mathematics with Applications 2012
Qinghua Feng Fanwei Meng

2013
YINGXIONG XIAO George A. Anastassiou

Motivated by the work of George A. Anastassiou in [George A. Anastassiou, Ostrowski and Landau inequalities for Banach space valued functions, Mathematical and Computer Modelling, 55 (2012), 312–329], we derive some Landau type inequalities for Banach space valued functions without assuming the boundary conditions.

Journal: :Mathematical and Computer Modelling 2010
George A. Anastassiou

Here we define a Caputo like discrete nabla fractional difference and we produce discrete nabla fractional Taylor formulae for the first time. We estimate their remaiders. Then we derive related discrete nabla fractional Opial, Ostrowski, Poincaré and Sobolev type inequalities .

2003
GEORGE A. ANASTASSIOU

We present optimal upper bounds for the deviation of a fuzzy continuous function from its fuzzy average over [a, b] ⊂ R, error is measured in the D-fuzzy metric. The established fuzzy Ostrowski type inequalities are sharp, in fact attained by simple fuzzy real number valued functions. These inequalities are given for fuzzy Hölder and fuzzy differentiable functions and these facts are reflected ...

Journal: :Ars Comb. 2012
Muhammad Hussain Edy Tri Baskoro Kashif Ali

This paper deals with two types of graph labelings namely, the super (a, d)-edge antimagic total labeling and super (a, d)-vertex antimagic total labeling on the Harary graph C n. We also construct the super edge-antimagic and super vertex-antimagic total labelings for a disjoint union of k identical copies of the Harary graph.

Journal: :Discrete Mathematics 1999
Baogen Xu

A graph is said to be a sum graph if there exists a set S of positive integers as its node set, with two nodes adjacent whenever their sum is in S. An integral sum graph is defined just as the sum graph, the difference being that S is a subset of 2~ instead of N*. The sum number of a given graph G is defined as the smallest number of isolated nodes which when added to G result in a sum graph. T...

2002
N. S. BARNETT C. BUŞE P. CERONE S. S. DRAGOMIR

Some weighted Ostrowski type integral inequalities for operators and vector-valued functions in Banach spaces are given. Applications for linear operators in Banach spaces and differential equations are also provided.

2003
S. S. Dragomir S. S. DRAGOMIR

Some Ostrowski type inequalities via Cauchy’s mean value theorem and applications for certain particular instances of functions are given.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید