A Method to Identify Simple Graphs by Special Binary Systems
Research Institute for Natural Sci., Department of Mathematics, Hanyang University, Seoul 04763, Korea
Department of Mathematics, University of Alabama, Tuscaloosa, AL 35487-0350, USA
Department of Mathematics Education, Dongguk University, Seoul 04620, Korea
Author to whom correspondence should be addressed.
Received: 27 June 2018 / Revised: 14 July 2018 / Accepted: 19 July 2018 / Published: 23 July 2018
In this paper, we discuss some relations between the semigroup,
, of all groupoids
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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Kim, H.S.; Neggers, J.; Ahn, S.S. A Method to Identify Simple Graphs by Special Binary Systems. Symmetry 2018, 10, 297.
Kim HS, Neggers J, Ahn SS. A Method to Identify Simple Graphs by Special Binary Systems. Symmetry. 2018; 10(7):297.
Kim, Hee S.; Neggers, J.; Ahn, Sun S. 2018. "A Method to Identify Simple Graphs by Special Binary Systems." Symmetry 10, no. 7: 297.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.