상세 보기
A Method to Identify Simple Graphs by Special Binary Systems
- Kim, Hee Sik;
- Neggers, J.;
- Ahn, Sun Shin
Citations
WEB OF SCIENCE
5Citations
SCOPUS
5초록
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.
키워드
binary system (groupoid); minimum (mutual) covering set; (mutual) shortest distance; (di)frame graph; d/BCK-algebra; D-ALGEBRAS; SEMIGROUPS; GROUPOIDS
- 제목
- A Method to Identify Simple Graphs by Special Binary Systems
- 저자
- Kim, Hee Sik; Neggers, J.; Ahn, Sun Shin
- 발행일
- 2018-07
- 유형
- Article
- 저널명
- Symmetry
- 권
- 10
- 호
- 7
- 언어
- ENG
- 출판사
- MDPI
- 발행국가
- 스위스
- ISSN
- E 2073-8994
P 2073-8994