نتایج جستجو برای: reformulated f index
تعداد نتایج: 693297 فیلتر نتایج به سال:
Let f(x; y) be a real polynomial of degree d with isolated critical points, and let i be the index of grad f around a large circle containing the critical points. An elementary argument shows that jij d ? 1. In this paper we show that i maxf1; d ? 3g. We also show that if all the level sets of f are compact, then i = 1, and otherwise jij d R ? 1 where d R is the sum of the multiplicities of the...
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
The reformulated Zagreb indices of a graph is obtained from the classical Zagreb by replacing vertex degree by edge degree and are defined as sum of squares of the degree of the edges and sum of product of the degrees of the adjacent edges. In this paper we give some explicit results for calculating the first and second reformulated Zagreb indices of dendrimers. Mathematics Subject Classificati...
There is a large number of effective cytotoxic drugs whose side effect profile, efficacy, and long-term use in man are well understood and documented over decades of use in clinical routine e.g. in the treatment of recurrent glioblastoma multiforme (GBM) and the hormone-refractory prostate cancer (HRPC). Both cancers are insensitive against most chemotherapeutic interventions; they have low res...
It has long been known that cylindrical algebraic decompositions (CADs) can in theory be used for robot motion planning. However, in practice even the simplest examples can be too complicated to tackle. We consider in detail a “Piano Mover’s Problem” which considers moving an infinitesimally thin piano (or ladder) through a right-angled corridor. Producing a CAD for the original formulation of ...
let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...
let g=(v,e) be a simple graph. an edge labeling f:e to {0,1} induces a vertex labeling f^+:v to z_2 defined by $f^+(v)equiv sumlimits_{uvin e} f(uv)pmod{2}$ for each $v in v$, where z_2={0,1} is the additive group of order 2. for $iin{0,1}$, let e_f(i)=|f^{-1}(i)| and v_f(i)=|(f^+)^{-1}(i)|. a labeling f is called edge-friendly if $|e_f(1)-e_f(0)|le 1$. i_f(g)=v_f(1)-v_f(0) is called the edge-f...
the padmakar-ivan (pi) index is a first-generation topological index (ti) based on sums overall edges between numbers of edges closer to one endpoint and numbers of edges closer to theother endpoint. edges at equal distances from the two endpoints are ignored. an analogousdefinition is valid for the wiener index w, with the difference that sums are replaced byproducts. a few other tis are discu...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید