Results 91 to 100 of about 305 (130)

Some Results on the Soft HG-Hypergroupoids

Contemporary Mathematics
Within the broader landscape of hyperstructure theory, a particular class of algebraic systems known as hypergroup-hypergroupoids emerges as a subject of significant mathematical interest.
Murat Alp, M. Dehghani̇zadeh
semanticscholar   +1 more source

Semihypergroup actions by using the generalized permutations

Annals of the University of Craiova. Mathematics and computer science series
An ordered hypergroupoid is a hypergroupoid together with a partial order such that satisfies the monotone condition. In this paper, we introduce the notion of semihypergroup actions on ordered hypergroupoids.
B. Davvaz, M. Mostafavi
semanticscholar   +1 more source

Construction of Fuzzy Hyper BCI-Algebras Using Fuzzy Hypergroupoid

New Mathematics and Natural Computation, 2022
G. Muhiuddin, E. Mohammadzadeh, F. Mohammadzadeh, R. A. Borzooei   +3 more
semanticscholar   +1 more source

Isomorphisms of Finite Hypergroupoids

1988
Summary We characterize a particular class of finite commutative hypergroupoids, called minimal hypergroupoids , such that for every finite commutative hypergroupoid H, there exists one and only one minimal hypergroupoid isomorphic to H. We denote it with MIN(H).
openaire   +1 more source

Hypergraphs, hypergroupoids and hypergroups.

1997
A hypergroupoid is a pair \(\langle H,\circ\rangle\) consisting of a nonempty set \(H\) and a binary multivalued operation, called hyperoperation. A quasi-hypergroup is a hypergroupoid \(\langle H,\circ\rangle\) satisfying \(x\circ H=H=H\circ x\), for each \(x\in H\).
openaire   +2 more sources

A new class of hypergroupoids associated to binary relations.

J. Multiple Valued Log. Soft Comput., 2003
Suppose that in a set a relation is considered, then several partial hyperoperations can be defined and studied. The authors define a new hyperoperation which is `smaller' than the one they already introduced and studied. Some properties of the above hyperstructure are proved and using a computer the size of those hyperoperations is obtained.
DE SALVO, Mario, LO FARO, Giovanni
openaire   +3 more sources

\(m\)-complete hypergroupoids

1999
The definition of \(m\)-complete and feebly \(m\)-complete hypergroupoids is given. Two sufficient conditions for the existence of feebly associative hypergroups are obtained. Properties and examples on this class of hyperstructures are also studied.
openaire   +2 more sources

Hypergroupoids and combinatorial structures

1992
Let \((H,\circ)\) be a finite hypergroupoid and associate to \(H\) the family of subsets of \(H\) \[ {\mathcal B} = \{x\circ y\mid (x,y) \in H^ 2\} = \{X_ 1^{(n_ 1)},\dots,X_ s^{(n_ s)}\} \] where the exponents in brackets denote the multiplicities. \((H,{\mathcal B})\) is a block design and it is called the design associated to \((H,\circ)\).
openaire   +2 more sources

A note on the cyclic hypergroupoids

1995
In this paper one begins to studi cyclic hypergroupoids. In particular, in the finite case, by using the set C_x= \{n\in N^* | x^{(n+1)}\subseteq \bigcup_{k=1}^n x^{(k)} \} and the maximum element of the set N-C_x, one characterizes the structure of the cyclic subhypergroupoid generated by x.
openaire   +1 more source

Decision-making Process Using Hyperstructures and Fuzzy Structures in Social Sciences

, 2018
Š. Hošková-Mayerová, A. Maturo
semanticscholar   +1 more source