In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

‎let g=(v,e) be a simple connected graph with vertex set v and edge set e. the first, second and third zagreb indices of g are respectivly defined by: $m_1(g)=sum_{uin v} d(u)^2, hspace {.1 cm} m_2(g)=sum_{uvin e} d(u).d(v)$ and $ m_3(g)=sum_{uvin e}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in g and uv is an edge of g connecting the vertices u and v. recently, the first and second m...

Multiplicative noise removal is of momentous significance in coherent imaging systems and various image processing applications. This paper proposes a new nonconvex variational model for multiplicative noise removal under the Weberized total variation (TV) regularization framework. Then, we propose and investigate another surrogate strictly convex objective function for Weberized TV regularizat...

We study the computational complexity of two Boolean non-linearity measures: the nonlinearity and the multiplicative complexity. We show that if one-way functions exist, no algorithm can compute the multiplicative complexity in time 2 O(n) given the truth table of length 2 n , in fact under the same assumption it is impossible to approximate the multiplicative complexity within a factor of (2 −...

We call φ the root function of Φ. The continuity of Φ implies that (1.2) φ(γ) → |γ| as |γ| → ∞. Moreover the converse is true, if φ is continuous and satisfies this asymptotic formula, then the function Φ formed as in (1.1) is a multiplicative distance function. Theorem 1.1. A continuous function φ : C → [0,∞) is the root function of a multiplicative distance function iff it satisfies (1.2). Ar...

We study the stochastic behavior of fundamental time-delayed feedback systems subjected to multiplicative noise. We derive exact results for the first and second moments and the autocorrelation function. For a particular class of systems we show how the variance depends on the amplitude of the multiplicative noise. Furthermore, we identify parameter regions of stationary solutions with finite a...

The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the only existing analysis of this popular signature scheme is in the random oracle model, where the resulting idealized signature is known as the RSA Full Domain Hash signature scheme (RSA-FDH). In fact, prior work has sh...