A Method to Identify Simple Graphs by Special Binary Systems

Abstract

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.

Some Implicativities for Groupoids and BCK-Algebras

“…Several properties on d-algebras, e.g., d-ideals, deformations, and companion d-algebras, were studied [2][3][4]. Recently, some notions of the graph theory were applied to the theory of groupoids [5].…”

General Implicativity in Groupoids

“…Several aspects on d-algebras were studied [4][5][6]. Recently some notions of the graph theory were applied to the theory of groupoids ( [7]).…”