Results 71 to 80 of about 117 (89)
Some of the next articles are maybe not open access.

Krasner \(F^{(m,n)}\)-hyperrings.

2014
Summary: In this paper, the notion of fuzzy Krasner \((m,n)\)-hyperrings (\(F^{(m,n)}\)-hyperrings) by using the notion of \(F^m\)-hyperoperations and \(F^n\)-operations is introduced and some related properties are investigated. In this regard, relationships between Krasner \(F^{(m,n)}\)-hyperrings and Krasner \((m,n)\)-hyperrings are considered.
Davvaz, B., Farshi, M.
openaire   +2 more sources

Soft intersection hyperstructures: Application in Krasner hyperrings

Journal of Intelligent & Fuzzy Systems, 2019
 In this paper first, we define the notions of left and right soft int-hypergroups and derive some of their basic properties. Second, we study these concepts in the context of complete hypergroups and polygroups. Then, we introduce the notions of left and right soft int-additive hyperrings and soft int-hyperideal. In special case we study these notions
Tahereh Zare   +3 more
openaire   +1 more source

Krasner Hyperring Theory

2023
Bijan Davvaz, Violeta Leoreanu-Fotea
openaire   +1 more source

A note on total graph of commutative Krasner hyperrings

Summary: The purpose of this paper is to introduce the notion of total graph of Krasner hyperrings. In this regard, a connection between the graph theory and the theory of hyperrings is constructed and some fundamental properties of the total graph of Krasner hyperrings are investigated. Finally, for a multiplicative-prime subset \(H\) of a hyperring \(
khojali, A.   +2 more
openaire   +2 more sources

r-Subhypermodules on Krasner Hyperrings

2021
Ersoy, Bayram Ali   +3 more
openaire   +1 more source

Some properties of hypermodules over Krasner hyperrings

A system (R,+,.) is said to be a Krasner hyperring if (i) (R,+) is a canonical hypergroup, (ii) (R,.) is a semigroup with zero 0 where 0 is the scalar identity of (R,+) and (iii) x.(y+z)=x.y+x.z and (y+z).x=y.x+z.x for all x,y,z [is an element of a set] R.
openaire   +1 more source

Home - About - Disclaimer - Privacy