Results 81 to 90 of about 268 (104)
Some of the next articles are maybe not open access.

Non-commutative hypergroupoid obtained from simple graphs

2023
Summary: The purpose of this paper is the study of non-weak commutative hypergroups associated with hypergraphs. In this regards, we construct a hyperoperation on the set of vertices of hypergraph and obtain some results and characterizations of them. Moreover, according to this hyperoperation, we investigate conditions under which the hypergroupoid is
Mirvakili, Saeed   +3 more
openaire   +1 more source

Results on generalized intuitionistic fuzzy hypergroupoids

Journal of Intelligent & Fuzzy Systems, 2019
 In this paper, we introduce and study the concept of generalized intuitionistic fuzzy hypergraph (shortly, g-if-hypergraph) and establish a relation between generalized if-hypergraph and if-hyperstructures. Further, we introduce partial if-hypergroupoid and extend the results for higher order if-hypergroupoids and study their properties.
Konwar, Nabanita   +2 more
openaire   +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

A note on quasi-Steiner hypergroupoids

Journal of Discrete Mathematical Sciences and Cryptography, 2003
Abstract The class of hyperstructures called quasi-Steiner hypergroupoids are studied and their group of automorphisms are found in some interesting cases. In particular, there exist quasi-Steiner hypergroupoids (H, ○) which group of automorphisms is exactly the group of automorphisms fixing a point and a line in the geometric space associated to (H, ○)
openaire   +2 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

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

Nerves of Trigroupoids as Duskin-Glenn’s 3-Hypergroupoids

Applied Categorical Structures, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

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

Matroidal \(M_\lambda\)-hypergroupoids. \(\lambda\)-linear mappings and automorphisms of \(M_\lambda\)-hypergroupoids

1998
In this paper a thoroughgoing study of hypergroupoids considered by the author in a previous work [Matematiche 52, No. 2, 271-295 (1997; Zbl 0941.20071)] is done. Let \(G\) be a group, \(\lambda\in G\) and \(\cdot\colon G\times M\) be an action of \(G\) on \(M\). The aim of this paper is to investigate the hyperoperation defined on \(M\) by: \(a\cdot b=
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

Home - About - Disclaimer - Privacy