Symmetry (Jul 2018)

A Method to Identify Simple Graphs by Special Binary Systems

  • Hee Sik Kim,
  • J. Neggers,
  • Sun Shin Ahn

DOI
https://doi.org/10.3390/sym10070297
Journal volume & issue
Vol. 10, no. 7
p. 297

Abstract

Read online

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