Detailed Information
Cited 4 time in 
Cited 4 time in 
Cited 4 time in
Metadata Downloads
A Method to Identify Simple Graphs by Special Binary Systemsopen access
- Authors
- Kim, Hee Sik; Neggers, J.; Ahn, Sun Shin
- Issue Date
- Jul-2018
- Publisher
- MDPI
- Keywords
- binary system (groupoid); minimum (mutual) covering set; (mutual) shortest distance; (di)frame graph; d/BCK-algebra
- Citation
- SYMMETRY-BASEL, v.10, no.7
- Indexed
- SCIE
SCOPUS
- Journal Title
- SYMMETRY-BASEL
- Volume
- 10
- Number
- 7
- ISSN
- 2073-8994
2073-8994
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Education > Department of Mathematics Education > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Related Researcher
- Ahn, Sun Shin
- College of Education (Department of Mathematics Education)