Discrete Mathematics and Symmetry / / edited by Angel Garrido.

• TeilnehmendeR: Garrido, Angel,
• Place / Publishing House: Basel, Switzerland : : MDPI - Multidisciplinary Digital Publishing Institute,, 2020.
• Year of Publication: 2020
• Language: English
• Physical Description: 1 online resource (458 pages)

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.