Search results:
Found 2
Listing 1  2 of 2 
Sort by

Choose an application
This book provides a timely overview of topics in fuzzy mathematics. It lays the foundation for further research and applications in a broad range of areas. It contains breakthrough analysis on how results from the many variations and extensions of fuzzy set theory can be obtained from known results of traditional fuzzy set theory. The book contains not only theoretical results, but a wide range of applications in areas such as decision analysis, optimal allocation in possibilistics and mixed models, pattern classification, credibility measures, algorithms for modeling uncertain data, and numerical methods for solving fuzzy linear systems.The book offers an excellent reference for advanced undergraduate and graduate students in applied and theoretical fuzzy mathematics. Researchers and referees in fuzzy set theory will find the book to be of extreme value.
fuzzy set theory  fuzzy semigroups  nilpotent fuzzy groups, fuzzy topological spaces  fuzzy decision making  pattern classi.cation  intuitionistic fuzzy sets  neutrosophic fuzzy sets  credibility measure  fuzzy linear systems  lattice isomorphism  possibilistic models, fuzzy BCK/BCI algebras, hypergraphs, Nhyper sets
Choose an application
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.
strongly regular graph  automorphism group  orbit matrix  binary polyhedral group  icosahedron  dodecahedron  600cell  Electric multiple unit trains  highlevel maintenance planning  time window  0–1 programming model  particle swarm algorithm  fixed point  splitquaternion  quadratic polynomial  splitoctonion  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  multigranulation  planar point set  convex polygon  disjoint holes  fuzzy logic  pseudoBCI algebra  quasimaximal element  KGunion  quasialternating BCKalgebra  quality function deployment  engineering characteristics  group decision making  2tuple  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 Balgebra  qfilter  quotient algebra  basic implication algebra  Detour–Harary index  maximum  unicyclic  bicyclic  cacti  threeway decisions  intuitionistic fuzzy sets  multigranulation 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  atombond 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  copermanental  isoperimetric number  random graph  intersection graph  social network  Abel–Grassmann’s groupoid (AGgroupoid)  Abel–Grassmann’s group (AGgroup)  involution AGgroup  commutative group  filter  graceful labeling  edge even graceful labeling  cylinder grid graph  selective maintenance  multistate system  human reliability  optimization  genetic algorithm  hypernearring  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 (CAgroupoid)  cancellative  variant CAgroupoids  decomposition theorem  construction methods
Listing 1  2 of 2 
Sort by
