LEADER 01958nam  2200349   450 
001 9910673903003321
005 20230623213325.0
035   $a(CKB)4100000011302128
035   $a(NjHacI)994100000011302128
035   $a(EXLCZ)994100000011302128
100   $a20230623d2020      uy             0
101 0 $aeng
135   $aur|||||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 00$aDiscrete Mathematics and Symmetry /$fedited by Angel Garrido
210  1$aBasel :$cMDPI - Multidisciplinary Digital Publishing Institute,$d2020.
215   $a1 online resource (458 pages) $cillustrations
311   $a3-03928-190-9 
320   $aIncludes bibliographical references.
330   $aSome 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.
606   $aSymmetry (Mathematics)
615  0$aSymmetry (Mathematics)
676   $a516.1
702   $aGarrido$b Angel
801  0$bNjHacI
801  1$bNjHacl
906   $aBOOK
912   $a9910673903003321
996   $aDiscrete Mathematics and Symmetry$92937360
997   $aUNINA