Reprint
Discrete Mathematics and Symmetry
Edited by
March 2020
458 pages
- ISBN978-3-03928-190-9 (Paperback)
- ISBN978-3-03928-191-6 (PDF)
This is a Reprint of the Special Issue Discrete Mathematics and Symmetry that was published in
Biology & Life Sciences
Chemistry & Materials Science
Computer Science & Mathematics
Physical Sciences
Summary
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.
Format
- Paperback
License and Copyright
© 2020 by the authors; CC BY-NC-ND license
Keywords
strongly regular graph; automorphism group; orbit matrix; binary polyhedral group; icosahedron; dodecahedron; 600-cell; Electric multiple unit trains; high-level maintenance planning; time window; 0–1 programming model; particle swarm algorithm; fixed point; split-quaternion; quadratic polynomial; split-octonion; neutrosophic set; neutrosophic rough set; pessimistic (optimistic) multigranulation neutrosophic approximation operators; complete lattice; rough set; matroid; operator; attribute reduction; graded rough sets; rough intuitionistic fuzzy sets; dominance relation; logical conjunction operation; logical disjunction operation; multi-granulation; planar point set; convex polygon; disjoint holes; fuzzy logic; pseudo-BCI algebra; quasi-maximal element; KG-union; quasi-alternating BCK-algebra; quality function deployment; engineering characteristics; group decision making; 2-tuple; metro station; emergency routes; graph partitioning; graph clustering; invariant measures; partition comparison; finite automorphism groups; graph automorphisms; Fuzzy sets; ring; normed space; fuzzy normed ring; fuzzy normed ideal; fuzzy implication; quantum B-algebra; q-filter; quotient algebra; basic implication algebra; Detour–Harary index; maximum; unicyclic; bicyclic; cacti; three-way decisions; intuitionistic fuzzy sets; multi-granulation rough intuitionistic fuzzy sets; granularity importance degree; complexity; Chebyshev polynomials; gear graph; pyramid graphs; edge detection; Laplacian operation; regularization; parameter selection; performance evaluation; aggregation operator; triangular norm; ⊗-convex set; atom-bond connectivity index; geometric arithmetic index; line graph; generalized bridge molecular graph; graceful labeling; edge graceful labeling; edge even graceful labeling; polar grid graph; graph; good drawing; crossing number; join product; cyclic permutation; nonlinear; synchronized; linear discrete; chaotic system; algorithm; generalized permanental polynomial; coefficient; co-permanental; isoperimetric number; random graph; intersection graph; social network; Abel–Grassmann’s groupoid (AG-groupoid); Abel–Grassmann’s group (AG-group); involution AG-group; commutative group; filter; graceful labeling; edge even graceful labeling; cylinder grid graph; selective maintenance; multi-state system; human reliability; optimization; genetic algorithm; hypernear-ring; multitransformation; embedding; distance matrix (spectrum); distance signlees Laplacian matrix (spectrum); (generalized) distance matrix; spectral radius; transmission regular graph; graph; good drawing; crossing number; join product; cyclic permutation; cyclic associative groupoid (CA-groupoid); cancellative; variant CA-groupoids; decomposition theorem; construction methods