Color Hypergroup and Join Space Obtained by the Vertex Coloring of a Graph

Abstract

In this paper, some new classes of hyperoperations, extracting from the vertex coloring of a graph, are presented. By these hyperoperations, we define a color hypergroup and a color join space on the vertex set of a graph. Also we give some examples to clarify these structures. Finally, we investigate the connection between the color join space and Graph Theory.