For the Fr'{e}chet algebras $(A, (p_k))$ and $(B, (q_k))$ and $n in mathbb{N}$, $ngeq 2$, a linear map $T:A rightarrow B$ is called textit{almost $n$-multiplicative}, with respect to $(p_k)$ and $(q_k)$, if there exists $varepsilongeq 0$ such that$$q_k(Ta_1a_2cdots a_n-Ta_1Ta_2cdots Ta_n)leq varepsilon p_k(a_1) p_k(a_2)cdots p_k(a_n),$$for each $kin mathbb{N}$ and $a_1, a_2, ldots, a_nin A$. Th...

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...

In this paper, we consider prize-collecting Steiner forest and k-Steiner forest when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we simplify the analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [7, 8] for the Euclidean Steiner forest problem. This is done by proving a new structural property an...

In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4]. The first semidefinite programming bound, which gained fa...

The priority method on the intuitionistic fuzzy preference relation (IFPR) is proposed. In order to avoid the operational difficulty in dealing with the intuitionistic sets, the equivalent interval matrices of the IFPR are introduced. Based on the multiplicative consistent definition of the fuzzy interval preference relation (FIPR), the goal programming models for deriving the priority vector o...

Background: For psychiatric disorders, comorbidity is a rule rather than exception. Thus it is particularly important to study additive and multiplicative effects of multiple mental disorders on suicidal behaviors. Objectives: The aim of this study was to investigate the ethnic differences in multiplicative effects of mental disorders on suicidal ideation among Black adults in the United States...

todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1  g and ( ) 2  g , under the name first and secondmultiplicative zagreb index, respectively. these are define as  ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...

Martindale proved that under some conditions every multiplicative isomorphism between two rings is additive. In this paper, we extend this theorem to a larger class of mappings and conclude that every multiplicative $(alpha, beta)-$derivation is additive.