Abstract
In this paper, we discuss some relations between the semigroup, Bin(X), of all groupoids (X, *) and graphs. We discuss mimimum (mutual) covering sets in several groupoids and discuss distances of graphs with groupoids. Finally, we obtain some results on frame graphs with groupoids.
Original language | English |
---|---|
Article number | 297 |
Journal | Symmetry |
Volume | 10 |
Issue number | 7 |
DOIs | |
State | Published - 1 Jul 2018 |
Keywords
- (di)frame graph
- (mutual) shortest distance
- Binary system (groupoid)
- D/BCK-algebra
- Minimum (mutual) covering set