Next Article in Journal
Symmetries, Conserved Properties, Tensor Representations, and Irreducible Forms in Molecular Quantum Electrodynamics
Previous Article in Journal
Multi-Granulation Neutrosophic Rough Sets on a Single Domain and Dual Domains with Applications
Open AccessArticle

A Method to Identify Simple Graphs by Special Binary Systems

1
Research Institute for Natural Sci., Department of Mathematics, Hanyang University, Seoul 04763, Korea
2
Department of Mathematics, University of Alabama, Tuscaloosa, AL 35487-0350, USA
3
Department of Mathematics Education, Dongguk University, Seoul 04620, Korea
*
Author to whom correspondence should be addressed.
Symmetry 2018, 10(7), 297; https://doi.org/10.3390/sym10070297
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, 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. View Full-Text
Keywords: binary system (groupoid); minimum (mutual) covering set; (mutual) shortest distance; (di)frame graph; d/BCK-algebra binary system (groupoid); minimum (mutual) covering set; (mutual) shortest distance; (di)frame graph; d/BCK-algebra
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.

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.

Article Access Map by Country/Region

1
Back to TopTop