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

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

A spatially extended Lotka-Volterra system of two competing species in the presence of two correlated noise sources is analyzed: (i) an external multiplicative time correlated noise, which mimics the interaction between the system and the environment; (ii) a dichotomous stochastic process, whose jump rate is a periodic function, which represents the interaction parameter between the species. Th...

In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ≥ 28.

there are several kinds of hyperrings, for example, krasnerhyperrings, multiplicative hyperring, general hyperrings and$h_v$-rings. in a multiplicative hyperring, the multiplication isa hyperoperation, while the addition is a binary operation. in this paper, the notion of derivation on multiplicative hyperrings is introduced and some related properties are investigated. {bf keywords:} multiplic...

We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. Abstract: We study the problem of local and asynchron...

We study the algebraic structure of the semigroup of all 2 × 2 tropical matrices under multiplication. Using ideas from tropical geometry, we give a complete description of Green’s relations and the idempotents and maximal subgroups of this semigroup.

Using a previous classification result on symmetric additive 2-cocycles, we collect a variety of facts about the Lubin–Tate cohomology of certain formal groups to produce a presentation of the 2-primary component of the scheme of symmetric multiplicative 2-cocycles. This scheme classifies certain kinds of highly symmetric multiextensions, generalizing those studied by Mumford or Breen. A low-or...