Cited 4 time in
A Method to Identify Simple Graphs by Special Binary Systems
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Hee Sik | - |
| dc.contributor.author | Neggers, J. | - |
| dc.contributor.author | Ahn, Sun Shin | - |
| dc.date.accessioned | 2023-04-28T08:41:04Z | - |
| dc.date.available | 2023-04-28T08:41:04Z | - |
| dc.date.issued | 2018-07 | - |
| dc.identifier.issn | 2073-8994 | - |
| dc.identifier.issn | 2073-8994 | - |
| dc.identifier.uri | https://scholarworks.dongguk.edu/handle/sw.dongguk/9342 | - |
| dc.description.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. | - |
| dc.language | 영어 | - |
| dc.language.iso | ENG | - |
| dc.publisher | MDPI | - |
| dc.title | A Method to Identify Simple Graphs by Special Binary Systems | - |
| dc.type | Article | - |
| dc.publisher.location | 스위스 | - |
| dc.identifier.doi | 10.3390/sym10070297 | - |
| dc.identifier.scopusid | 2-s2.0-85050406268 | - |
| dc.identifier.wosid | 000440215400067 | - |
| dc.identifier.bibliographicCitation | SYMMETRY-BASEL, v.10, no.7 | - |
| dc.citation.title | SYMMETRY-BASEL | - |
| dc.citation.volume | 10 | - |
| dc.citation.number | 7 | - |
| dc.type.docType | Article | - |
| dc.description.isOpenAccess | Y | - |
| dc.description.journalRegisteredClass | scie | - |
| dc.description.journalRegisteredClass | scopus | - |
| dc.relation.journalResearchArea | Science & Technology - Other Topics | - |
| dc.relation.journalWebOfScienceCategory | Multidisciplinary Sciences | - |
| dc.subject.keywordPlus | D-ALGEBRAS | - |
| dc.subject.keywordPlus | SEMIGROUPS | - |
| dc.subject.keywordPlus | GROUPOIDS | - |
| dc.subject.keywordAuthor | binary system (groupoid) | - |
| dc.subject.keywordAuthor | minimum (mutual) covering set | - |
| dc.subject.keywordAuthor | (mutual) shortest distance | - |
| dc.subject.keywordAuthor | (di)frame graph | - |
| dc.subject.keywordAuthor | d/BCK-algebra | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
30, Pildong-ro 1-gil, Jung-gu, Seoul, 04620, Republic of Korea+82-2-2260-3114
Copyright(c) 2023 DONGGUK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
