Some properties of vague graph structures

A graph structure is a generalization of simple graphs. Graph structures are very useful tools for the study of different domains of computational intelligence and computer science. A vague graph structure is a generalization of a vague graph. In this research paper, we present several different types of operations including cartesian product, cross product, lexicographic product, union, and composition on vague graph structures. We also introduce some results of operations.Publisher's Versio

Interval-valued intuitionistic fuzzy soft graphs with application

The concept of interval-valued intuitionistic fuzzy soft sets and fuzzy graphs structure together constitute a new structure called an interval-valued intuitionistic fuzzy soft graph. The definitions of interval-valued intuitionistic fuzzy soft subgraph and strong interval-valued intuitionistic fuzzy soft graph are introduced with suitable examples. The degree of the good influence of a parameter in a fuzzy network and there is no influence by an interval number in the same system. Similarly, the effectiveness and non-effectiveness of the other fuzzy system on other parameters is measured by the concept of soft graphs in this article. Also, several different types of operations, including Cartesian product, strong product and composition on interval-valued intuitionistic fuzzy soft graphs are presented. Some related properties of these operations are investigated. Finally, we give a real-life application of interval-valued intuitionistic fuzzy soft graphs on social media and find out the most affected person in social media.Publisher's Versio

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

Fuzzy Sets, Fuzzy Logic and Their Applications 2020

The present book contains the 24 total articles accepted and published in the Special Issue “Fuzzy Sets, Fuzzy Logic and Their Applications, 2020” of the MDPI Mathematics journal, which covers a wide range of topics connected to the theory and applications of fuzzy sets and systems of fuzzy logic and their extensions/generalizations. These topics include, among others, elements from fuzzy graphs; fuzzy numbers; fuzzy equations; fuzzy linear spaces; intuitionistic fuzzy sets; soft sets; type-2 fuzzy sets, bipolar fuzzy sets, plithogenic sets, fuzzy decision making, fuzzy governance, fuzzy models in mathematics of finance, a philosophical treatise on the connection of the scientific reasoning with fuzzy logic, etc. It is hoped that the book will be interesting and useful for those working in the area of fuzzy sets, fuzzy systems and fuzzy logic, as well as for those with the proper mathematical background and willing to become familiar with recent advances in fuzzy mathematics, which has become prevalent in almost all sectors of the human life and activity