‎Let $R$ be a $*$-prime ring with center‎ ‎$Z(R)$‎, ‎$d$ a non-zero $(sigma,tau)$-derivation of $R$ with associated‎ ‎automorphisms $sigma$ and $tau$ of $R$‎, ‎such that $sigma$‎, ‎$tau$‎ ‎and $d$ commute with $'*'$‎. ‎Suppose that $U$ is an ideal of $R$ such that $U^*=U$‎, ‎and $C_{sigma,tau}={cin‎ ‎R~|~csigma(x)=tau(x)c~mbox{for~all}~xin R}.$ In the present paper‎, ‎it is shown that if charac...

Let $R$ be a prime ring with its Utumi ring of quotients $U$,  $C=Z(U)$ the extended centroid of $R$, $L$ a non-central Lie ideal of $R$ and $0neq a in R$. If $R$ admits a generalized derivation $F$ such that $a(F(u^2)pm F(u)^{2})=0$ for all $u in L$, then one of the following holds: begin{enumerate} item there exists $b in U$ such that $F(x)=bx$ for all $x in R$, with $ab=0$; item $F(x)=...

Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...

We consider a 2-dimensional representation of the Hecke algebra $H(G_7, u)$, where $G_7$ is the complex reflection group and $u$ is the set of indeterminates $u = (x_1,x_2,y_1,y_2,y_3,z_1,z_2,z_3)$. After specializing the indetrminates to non zero complex numbers, we then determine a necessary and sufficient condition that guarantees the irreducibility of the complex specialization of the repre...

Recently, Hua et al. defined a new topological index based on degrees and inverse of distances between all pairs of vertices. They named this new graph invariant as reciprocal degree distance as 1 { , } ( ) ( ( ) ( ))[ ( , )] RDD(G) = u v V G d u  d v d u v , where the d(u,v) denotes the distance between vertices u and v. In this paper, we compute this topological index for Grassmann graphs.

In this paper, we are concerned with the following fractional Schrödinger-Poisson system:    (−∆s)u + u + λφu = µf(u) +|u|p−2|u|, x ∈R3 (−∆t)φ = u2, x ∈R3 where λ,µ are two parameters, s,t ∈ (0,1] ,2t + 4s > 3 ,1 < p ≤ 2∗ s and f : R → R is continuous function. Using some critical point theorems and truncation technique, we obtain the existence and multiplicity of non-trivial solutions with ...

For a graph G, the irregularity and total irregularity of G are defined as irr(G)=∑_(uv∈E(G))〖|d_G (u)-d_G (v)|〗 and irr_t (G)=1/2 ∑_(u,v∈V(G))〖|d_G (u)-d_G (v)|〗, respectively, where d_G (u) is the degree of vertex u. In this paper, we characterize all ‎connected Eulerian graphs with the second minimum irregularity, the second and third minimum total irregularity value, respectively.

let $g$ be a connected graph with vertex set $v(g)$‎. ‎the‎ ‎degree resistance distance of $g$ is defined as $d_r(g) = sum_{{u‎,‎v} subseteq v(g)} [d(u)+d(v)] r(u,v)$‎, ‎where $d(u)$ is the degree‎ ‎of vertex $u$‎, ‎and $r(u,v)$ denotes the resistance distance between‎ ‎$u$ and $v$‎. ‎in this paper‎, ‎we characterize $n$-vertex unicyclic‎ ‎graphs having minimum and second minimum degree resista...

The increasing computing demands of autonomous driving applications have driven the adoption multicore processors in real-time systems, which turn renders energy optimizations critical for reducing battery capacity and vehicle weight. A typical optimization method targeting traditional systems finds a speed under static deadline, resulting conservative savings that are unable to exploit dynamic...