Results 101 to 110 of about 305 (130)
Some of the next articles are maybe not open access.

Binary relations and hypergroupoids

2000
The author associates a partial hyperoperation \(\langle\widetilde\circ_R\rangle\) to every binary relation \(R\) defined on a non-empty set \(H\) in the following way: \(x\widetilde\circ_R y=\{z\in H\mid xRz,\;zRy\}\). The hyperstructure \(\langle H,\widetilde\circ_R\rangle\) is a partial hypergroupoid and the necessary and sufficient condition so ...
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

Hypergroupoids and fundamental relation

1994
In this work we study hypergroupoids whose β-relation is transitive, by using the fundamental relations β, β*, δ and δ*. We take several examples, finding the necessary and sufficient conditions such that a quasi-hypergroup has β*=β=δ=δ* (i.e. it is of kind T_1).
openaire   +1 more source

Atanassov's intuitionistic fuzzy grade of hypergroups

Information Sciences, 2010
I. Cristea, B. Davvaz
semanticscholar   +1 more source

Cayley graph associated to a semihypergroup

, 2020
Khadije Shamsi, R. Ameri, S. Mirvakili
semanticscholar   +1 more source

On a strongly regular relation in hypergroupoids

1993
Let \(H\) be a hypergroupoid and \(n \in \mathbb{N}^*\). Let \(\gamma\) be a grouping of the indices \(\{1,\dots,n\}\) respecting their order. If \(z_ 1,z_ 2,\dots,z_ n\) are elements of \(H\) we denote by \(\displaystyle\prod^ n_{i=1}{^{(\gamma)} z_ i}\) the product of these elements according to \(\gamma\). Define on \(H\) a relation \(\Delta\) by: \(
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

Home - About - Disclaimer - Privacy