نتایج جستجو برای: strongly 2 multiplicative

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

Journal: :transactions on combinatorics 2012
mehdi eliasi

the first ($pi_1$) and the second $(pi_2$) multiplicative zagreb indices of a connected graph $g$, with vertex set $v(g)$ and edge set $e(g)$, are defined as $pi_1(g) = prod_{u in v(g)} {d_u}^2$ and $pi_2(g) = prod_{uv in e(g)} {d_u}d_{v}$, respectively, where ${d_u}$ denotes the degree of the vertex $u$. in this paper we present a simple approach to order these indices for connected graphs on ...

1998
Andreas Brandstadt Victor Chepoi Feodor Dragan

In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...

1997
Andreas Brandstädt Victor Chepoi Feodor F. Dragan

In this paper we show that, for each chordal graph G, there is a tree T such that T is a spanning tree of the square G2 of G and, for every two vertices, the distance between them in T is not larger than the distance in G plus 2. Moreover, we prove that, if G is a strongly chordal graph or even a dually chordal graph, then there exists a spanning tree T of G that is an additive 3-spanner as wel...

Journal: :bulletin of the iranian mathematical society 0
t. ‎ghasemi honary‎ department of‎ ‎mathematics, ‎kharazmi university‎, ‎1561836314, tehran‎, ‎iran m. omidi department of‎ ‎mathematics, ‎kharazmi university‎, ‎1561836314, tehran‎, ‎iran a. h. sanatpour department of‎ ‎mathematics, ‎kharazmi university‎, ‎1561836314, tehran‎, ‎iran

for fr$acute{mathbf{text{e}}}$chet algebras $(a, (p_n))$ and $(b, (q_n))$, a linear map $t:arightarrow b$ is textit{almost multiplicative} with respect to $(p_n)$ and $(q_n)$, if there exists $varepsilongeq 0$ such that $q_n(tab - ta tb)leq varepsilon p_n(a) p_n(b),$ for all $n in mathbb{n}$, $a, b in a$, and it is called textit{weakly almost multiplicative} with respect to $(p_n)$ and $(q_n)$,...

2002
MARIA GORDINA

We prove that a class of stochastic differential equations with multiplicative noise has a unique solution in a noncommutative L2 space associated with a von Neumann algebra. As examples we consider usual L2 on a measure space, Hilbert-Schmidt operators and a hyperfinite II1-factor. A problem of finding an inverse of the solution is then discussed. Finally, we explain how a stochastic different...

Journal: :transactions on combinatorics 2014
zhaoyang luo jianliang wu

let $g$ be a connected graph. the multiplicative zagreb eccentricity indices of $g$ are defined respectively as ${bf pi}_1^*(g)=prod_{vin v(g)}varepsilon_g^2(v)$ and ${bf pi}_2^*(g)=prod_{uvin e(g)}varepsilon_g(u)varepsilon_g(v)$, where $varepsilon_g(v)$ is the eccentricity of vertex $v$ in graph $g$ and $varepsilon_g^2(v)=(varepsilon_g(v))^2$. in this paper, we present some bounds of the multi...

2015
Zhaojuan Wang Shengfan Zhou Z. J. Wang S. F. Zhou

In this paper we study the asymptotic dynamics of the stochastic strongly damped wave equation with multiplicative noise under homogeneous Dirichlet boundary condition. We investigate the existence of a compact random attractor for the random dynamical system associated with the equation.

In this paper, at first the elemantary and basic concepts of multiplicative discrete and continous differentian and integration introduced. Then for these kinds of differentiation invariant functions the general solution of discrete and continous multiplicative differential equations will be given. Finaly a vast class of difference equations with variable coefficients and nonlinear difference e...

Journal: :IJICoT 2015
Magnus Find Daniel Smith-Tone Meltem Sönmez Turan

Multiplicative complexity is a complexity measure defined as the minimum number of AND gates required to implement a given primitive by a circuit over the basis (AND, XOR, NOT). Implementations of ciphers with a small number of AND gates are preferred in protocols for fully homomorphic encryption, multi-party computation and zero-knowledge proofs. In 2002, Fischer and Peralta [12] showed that t...

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

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