Discrete Mathematics and Symmetry

Some of the most beautiful studies in Mathematics are related to Symmetry and Geometry. For this reason, we select here some contributions about such aspects and Discrete Geometry. As we know, Symmetry in a system means invariance of its elements under conditions of transformations. When we consider network structures, symmetry means invariance of adjacency of nodes under the permutations of node set. The graph isomorphism is an equivalence relation on the set of graphs. Therefore, it partitions the class of all graphs into equivalence classes. The underlying idea of isomorphism is that some objects have the same structure if we omit the individual character of their components. A set of graphs isomorphic to each other is denominated as an isomorphism class of graphs. The automorphism of a graph will be an isomorphism from G onto itself. The family of all automorphisms of a graph G is a permutation group

Contributions to the theory of near-vector spaces, their geometry, and hyperstructures

Mathematical Science

Weak embeddable hypernear-rings

In this paper we extend one of the main problems of near-rings to the framework of algebraic hypercompositional structures. This problem states that every near-ring is isomorphic with a near-ring of the transformations of a group. First we endow the set of all multitransformations of a hypergroup (not necessarily abelian) with a general hypernear-ring structure, called the multitransformation general hypernear-ring associated with a hypergroup. Then we show that any hypernear-ring can be weakly embedded into a multitransformation general hypernear-ring, generalizing the similar classical theorem on near-rings. Several properties of hypernear-rings related with this property are discussed and illustrated also by examples