نتایج جستجو برای: reformulated f index
تعداد نتایج: 693297 فیلتر نتایج به سال:
Homles' Index to Lysias - Index LysiacusDavidis H. Holmes, Ph.D. Bonn (F. Cohen.1895. Pp. 213. 8 M.)
For a graph G = (V, E) and a coloring f : V (G) → Z 2 let vf (i) = |f−1(i)|. f is said to be friendly if |vf (1)−vf (0)| ≤ 1. The coloring f : V (G) → Z 2 induces an edge labeling f∗ : E(G) → Z 2 defined by f∗(xy) = f(x) + f(y) ∀xy ∈ E(G), where the summation is done in Z 2. Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| ...
Let X be a given nonempty closed convex subset in IR and let f : X×X −→ IR be a given bifunction with f(x, x) = 0 for all x ∈ X. We are interested in the following quasi-equilibrium problem { Find x ∈ K(x) such that f(x, y) ≥ 0 ∀ y ∈ K(x) (QEP ) where K(·) is a multivalued mapping X −→ 2 . When the mapping x −→ K(x) is such that K(x) = X for all x ∈ X, (QEP ) reduces naturally to the equilibriu...
For a graph G = (V,E) and a binary labeling (coloring) f : V (G) → Z2, let vf (i) = |f−1(i)|. f is said to be friendly if |vf (1) − vf (0)| ≤ 1. The labeling f : V (G) → Z2 induces an edge labeling f∗ : E(G) → Z2 defined by f∗(xy) = |f(x)− f(y)| ∀xy ∈ E(G). Let ef (i) = |f∗−1(i)|. The friendly index set of the graph G, denoted by FI(G), is defined by FI(G) = {|ef (1)− ef (0)| : f is a friendly ...
Let Ω be an algebraic closure of Qp and let F be a finite extension of Qp contained in Ω. Given positive integers f and e, the number of extensions K/F contained in Ω with residue degree f and ramification index e was computed by Krasner. This paper is concerned with the number I(F, f, e) of F -isomorphism classes of such extensions. We determine I(F, f, e) completely when p2 ∤ e and get partia...
Let G be a graph with vertex set V(G) and edge set E(G), and let A be an abelian group. A labeling f: V(G) A induces an edge labeling f"': E(G) A defined by f"'(xy) = f(x) + fey), for each edge xy e E(G). For i e A, let vt<i) = card { v e V(G) : f(v) = i} and er(i) = card ( e e E(G) : f"'(e) = i}. Let c(f) = {Iet<i) etG)1 : (i, j) e A x A}. A labeling f of a graph G is said to be A friendly if...
BACKGROUND No reliable biochemical markers exist for the differentiation between iron deficiency anemia (IDA) and anemia of chronic disease (ACD) in the setting of inflammatory bowel disease (IBD). The aim of this study was to investigate the use of soluble transferrin receptor (sTfR) and sTfR-ferritin (sTfR-F) index in the evaluation of anemia in patients with IBD. METHODS One hundred IBD pa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید