The stress of a vertex is node centrality index, which has been introduced by Shimbel (1953). in graph the number geodesics (shortest paths) passing through it. In this paper, we introduce new topological index for graphs called square root sum using stresses vertices. Further, establish some inequalities, prove results and compute stress-sum standard graphs.

Let $$L(t) = - \mathrm{div} \left( A(x,t) \nabla _x \right) $$ for $$t \in (0, \tau )$$ be a uniformly elliptic operator with boundary conditions on domain $$\Omega of $$\mathbb {R}^d$$ and $$\partial \frac{\partial }{\partial t}$$ . Define the parabolic $${{\mathcal {L}}}= \partial + L$$ $$L^2(0, , L^2(\Omega ))$$ by $$({{\mathcal {L}}}u)(t) := u(t)}{\partial t} L(t)u(t)$$ We assume very littl...

This paper focuses on the convergence rate and numerical characteristics of the nonlinear information consensus filter for object tracking using a distributed sensor network. To avoid the Jacobian calculation, improve the numerical characteristic and achieve more accurate estimation results for nonlinear distributed estimation, we introduce square-root extensions of derivative-free information ...

Square-root is a function for which numerous numerical methods have been developed. In most math packages for microprocessors, simple iterative methods have been used, as no special demands for speed — nor even for accuracy in some cases are expected: e.g. in [ l ] and [2] the execution time of square-rooting is approx. 2-5 times longer than that of multiplication, and in [3] a quintuple error ...