Results 91 to 100 of about 165 (103)

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

Fundamental relation on non-associative hypergroupoids

1999
The paper deals with the fundamental relation \(\beta^*\) defined on non-associative hypergroupoids. The relation \(\beta^*\) on classes weaker than semihypergroups is studied, in relation with axioms originating from feebly associativity and strongly regular equivalence. Examples are also provided.
openaire   +2 more sources

Partial hypergroupoids of class two.

1994
The author studies the finite partial hypergroupoids, such that there are exactly two pairs of elements, which define non-empty hyperproducts. He solves the combinatorial problem of finding, up to isomorphism, the number of the aforesaid hyperstructure.
openaire   +1 more source

Soft crossed hypermodules and soft HG-hypergroupoids

Summary: In this article, we introduce the soft subhypergroupoid and soft action hypergroupoid and study their properties. We consider the category of soft hypergroupoids whose objects are soft hypergroupoids and morphisms are soft hypergroupoid homomorphisms.
openaire   +2 more sources

About the fundamental relations defined on the hypergroupoids associated with binary relations

European Journal of Combinatorics, 2011
Irina Cristea
exaly  

On the algebra associated with a finite hypergroupoid

1989
The author investigates the algebra associated with a finite hypergroupoid. He studies the relations between quasi-hypergroups and division algebras. He finds some criteria for constructing hypergroupoids such that the associated algebra is associative. He introduces and studies a functor from the category of hypergroupoids to the category of algebras.
openaire   +1 more source

Feebly associative hypergroupoids

1993
GENTILE, GIUSEPPE, MIGLIORATO R.
openaire   +1 more source