A method to identify simple graphs by special binary systems

Hee Sik Kim, J. Neggers, Sun Shin Ahn

Research output: Contribution to journalArticlepeer-review

3 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 languageEnglish
Article number297
JournalSymmetry
Volume10
Issue number7
DOIs
StatePublished - 1 Jul 2018

Keywords

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

Fingerprint

Dive into the research topics of 'A method to identify simple graphs by special binary systems'. Together they form a unique fingerprint.

Cite this