نتایج جستجو برای: 2 absorbing i prime submodule

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

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

Journal: :Filomat 2021

Let G be an abelian group with identity e. R a graded multiplicative hyperring and ? : Igr(R) expansion function of Igr(R), where is the set all hyperideals R. In this paper, we introduce study concepts ?-primary 2-absorbing which are extended classes prime 2- absorbing R, respectively. Moreover, give basic properties these new types investigate relations among structures.

Let $R$ be a commutative ring with identity‎. ‎A proper ideal $P$ of $R$ is a $(n-1,n)$-$Phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin R$‎, ‎$a_1cdots a_nin Pbackslash P^m$ ($a_1cdots a_nin Pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin P$‎, ‎for some $iin{1,ldots,n}$; ($m,ngeq 2$)‎. ‎In this paper several results concerning $(n-1,n)$-$Phi_m$-prime and $(n-1,n)$-...

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

Journal: :journal of algorithms and computation 0
r. ponraj department of mathematics, sri paramakalyani college,alwarkurichi-627412, india rajpal singh research scholar, department of mathematics manonmaniam sundaranar university, tirunelveli-627012, india s. sathish narayanan department of mathematics, sri paramakalyani college,alwarkurichi-627412, india

let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

Journal: :journal of algebraic systems 2014
ashkan nikseresht habib sharif

we state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. in particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. also we show that if m is an strong comultiplicati...

Journal: :Research in the Mathematical Sciences 2023

Let $$(R,\mathfrak {m})$$ be a Noetherian local ring of prime characteristic p and Q an $$\mathfrak {m}$$ -primary parameter ideal. We give criteria for F-rationality R using the tight Hilbert function $$H^*_Q(n)=\ell (R/(Q^n)^*)$$ coefficient $$e_1^*(Q)$$ polynomial $$P^*_Q(n)=\sum _{i=0}^d(-1)^ie_i^*(Q)\left( {\begin{array}{c}n+d-1-i\\ d-i\end{array}}\right) .$$ obtain lower bound equidimensi...

Journal: :Eur. J. Comb. 1999
Josep M. Brunat Margarida Espona Miguel Angel Fiol Oriol Serra

The complete generalized cycle G(d, n) is the digraph which has Zn × Zd as the vertex set and every vertex (i, x) is adjacent to the d vertices (i + 1, y) with y ∈ Zd . As a main result, we give a necessary and sufficient condition for the iterated line digraph G(d, n, k) = Lk−1G(d, n), with d a prime number, to be a Cayley digraph in terms of the existence of a group0d of order d and a subgrou...

Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....

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

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