Path hypergroupoids: commutativity and graph connectivity.
From MaRDI portal
Publication:477727
DOI10.1016/j.ejc.2014.08.012zbMath1308.20064OpenAlexW2081042425MaRDI QIDQ477727
Antonios Kalampakas, Stefanos Spartalis
Publication date: 9 December 2014
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2014.08.012
Related Items (4)
The non-commuting graph of a non-central hypergroup ⋮ On Complementable Semihypergroups ⋮ Some algebraic hyperstructures related to zero forcing sets and forcing digraphs ⋮ Color hypergroup and join space obtained by the vertex coloring of a graph
Cites Work
- About the fundamental relations defined on the hypergroupoids associated with binary relations.
- Binary relations and reduced hypergroups.
- Hypergroups and \(n\)-ary relations.
- \(\mathbf C\)-hypergroupoids obtained by special binary relations.
- Hypergroups and binary relations
- Hyperstructures associated with binary relations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Path hypergroupoids: commutativity and graph connectivity.