Path hypergroupoids: commutativity and graph connectivity.
From MaRDI portal
Publication:477727
DOI10.1016/J.EJC.2014.08.012zbMATH Open1308.20064OpenAlexW2081042425MaRDI QIDQ477727FDOQ477727
Authors: Antonios Kalampakas, S. 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypergroups and binary relations
- Hyperstructures associated with binary relations
- Binary relations and hypergroupoids
- Title not available (Why is that?)
- Binary relations and reduced hypergroups.
- About the fundamental relations defined on the hypergroupoids associated with binary relations.
- The path hyperoperation
- Title not available (Why is that?)
- Title not available (Why is that?)
- The hyperoperation relation and the Corsini's partial or not-partial hypergroupoids (a classification).
- Hypergroupoids obtained from groupoids with binary relations.
- Hypergroups and \(n\)-ary relations.
- \(\mathbf C\)-hypergroupoids obtained by special binary relations.
Cited In (10)
- On the path hyperoperation and its connections with hypergraph theory
- Color hypergroup and join space obtained by the vertex coloring of a graph
- Some algebraic hyperstructures related to zero forcing sets and forcing digraphs
- Title not available (Why is that?)
- The non-commuting graph of a non-central hypergroup
- Hypergroups associated with graphs and automata.
- Title not available (Why is that?)
- On the sequence of hypergroups and membership functions determined by a hypergraph.
- The path hyperoperation
- On complementable semihypergroups.
This page was built for publication: Path hypergroupoids: commutativity and graph connectivity.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477727)
