A method to identify simple graphs by special binary systems

Hee Sik Kim; J. Neggers; Sun Shin Ahn

doi:10.3390/sym10070297

A method to identify simple graphs by special binary systems

Hee Sik Kim
, J. Neggers
, Sun Shin Ahn

Department of Mathematics Education

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Article number	297
Journal	Symmetry
Volume	10
Issue number	7
DOIs	https://doi.org/10.3390/sym10070297
State	Published - 1 Jul 2018

Keywords

(di)frame graph
(mutual) shortest distance
Binary system (groupoid)
D/BCK-algebra
Minimum (mutual) covering set

Access to Document

10.3390/sym10070297

Cite this

@article{ca7f50c97ac24332a47d910e5e121733,

title = "A method to identify simple graphs by special binary systems",

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.",

keywords = "(di)frame graph, (mutual) shortest distance, Binary system (groupoid), D/BCK-algebra, Minimum (mutual) covering set",

author = "Kim, \{Hee Sik\} and J. Neggers and Ahn, \{Sun Shin\}",

note = "Publisher Copyright: {\textcopyright} 2018 by the author.",

year = "2018",

month = jul,

day = "1",

doi = "10.3390/sym10070297",

language = "English",

volume = "10",

journal = "Symmetry",

issn = "2073-8994",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "7",

}

TY - JOUR

T1 - A method to identify simple graphs by special binary systems

AU - Kim, Hee Sik

AU - Neggers, J.

AU - Ahn, Sun Shin

PY - 2018/7/1

Y1 - 2018/7/1

N2 - 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.

AB - 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.

KW - (di)frame graph

KW - (mutual) shortest distance

KW - Binary system (groupoid)

KW - D/BCK-algebra

KW - Minimum (mutual) covering set

UR - https://www.scopus.com/pages/publications/85050406268

U2 - 10.3390/sym10070297

DO - 10.3390/sym10070297

M3 - Article

AN - SCOPUS:85050406268

SN - 2073-8994

VL - 10

JO - Symmetry

JF - Symmetry

IS - 7

M1 - 297

ER -

A method to identify simple graphs by special binary systems

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this