A Method to Identify Simple Graphs by Special Binary Systems
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.
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2018-07-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2073-8994/10/7/297 |