نتایج جستجو برای: variable sum exdeg index
تعداد نتایج: 710924 فیلتر نتایج به سال:
Article history: Received 19 May 2009 Received in revised form 13 July 2009 Accepted 22 August 2009 Available online 15 September 2009 A latent variable analysis was conducted to examine the nature of individual differences in lapses of attention and their relation to executive and fluid abilities. Participants performed a sustained attention task along with multiple measures of executive contr...
We prove an extension of the Index Theorem for Morse–Sturm systems of the form −V ′′ + RV = 0, where R is symmetric with respect to a (non positive) symmetric bilinear form, and thus the corresponding differential operator is not self-adjoint. The result is then applied to the case of a Jacobi equation along a geodesic in a Lorentzian manifold, obtaining an extension of the Morse Index Theorem ...
Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih v v v over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...
Probit residuals need not sum to zero in general. However, if explanatory variables are qualitative the sum can be shown to be zero for many models. Indeed this remains true for binary dependent variable models other than Probit and Logit. Even if some explanatory variables are quantitative, residuals can sum to almost zero more often than might at first seem plausible.
In this note, we derive the lower bound on the sum for Wiener index of bipartite graph and its bipartite complement, as well as the lower and upper bounds on this sum for the Randić index and Zagreb indices. We also discuss the quality of these bounds.
let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...
BACKGROUND/AIMS Pretreatment nutritional status is an important prognostic factor in patients treated with conventional cytotoxic chemotherapy. In the era of target therapies, its value is overlooked and has not been investigated. The aim of our study is to evaluate the value of nutritional status in targeted therapy. METHODS A total of 2012 patients with non-small cell lung cancer (NSCLC) we...
In this research to show how 14 variables affect inflation in period 1974-2007, Bayesian model averaging and weighted average least square methods has been used. And also by using Vselect program optimal model for every independent variable has been identified. Results show that price index growth of imported goods is the main factor for inflation in Iran economic. In ranking this 14 factors –t...
Swingle [7]1 has given the following definitions. (1) A continuum M is said to be the finished sum of the continua of a collection G if G* = M and no continuum of G is a subset of the sum of the others.2 (2) If » is a positive integer, the continuum M is said to be indecomposable under index » if If is the finished sum of « continua and is not the finished sum of »+1 continua. Swingle has shown...
The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید