Abstract: A hypergraph is one of the most developing area for modeling various practical problems in different fields, including computer science, biological sciences, social networks and psychology. Our main discussion in this research paper is to apply the notion of intuitionistic fuzzy sets to extend the theory of hypergraphs. We introduce the concept of isomorphism, dual intuitionistic fuzzy hypergraph, intuitionistic fuzzy line graph and 2-section of an intuitionistic fuzzy hypergraph. We present some applications of intuitionistic fuzzy hypergraphs in planet surface networks, selection of authors of of intersecting communities in a social network and grouping of incompatible chemical substances. We design…certain algorithms to construct dual intuitionistic fuzzy hypergraph, intuitionistic fuzzy line graph and the selection of objects in decision-making problems.
Show more
Abstract: Recently, bipolar fuzzy graph is a growing research topic as it is the generalization of fuzzy graphs. In this paper, at first we define three new operations on bipolar fuzzy graphs, viz. direct product, semi strong product and strong product. Likewise, sufficient conditions for each one of them to be complete are given. Also, it is proved that any of the products of strong bipolar fuzzy graphs are strong bipolar fuzzy graphs.
Keywords: Bipolar fuzzy graph, direct product, strong product, ring sum
Abstract: Vague graph represents the systems with uncertainty perfectly. In this paper, we introduced the strengths of paths in vague graphs. Different types of strong edges are discussed with examples. A new concept of strong edges, namely, independent strong edges is defined. The condition of vertex membership values of a complete vague graph such that all the edges are independent strong edge, is established. After that, strong vertex, vertex connectivity, edge connectivity of vague graphs are introduced. The relation between edge connectivity and independent strong edge is established. Besides, several properties of the stated graphs have been proved.
Keywords: Vague graphs, strong edges, connectivity in vague graphs
Abstract: In this paper, some new connectivity concepts in fuzzy labeling graphs are defined. The concepts of strong arc, partial cut node, bridge and block are introduced. A new type of fuzzy labeling graphs called θ -fuzzy labeling graphs is defined. Likewise, this paper generalizes the tree concept in fuzzy labeling graph, which plays a crucial role in many areas of science and technology.
Abstract: A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, vague competition graph and m -step competition graphs related to a vague graph are introduced. Likewise, some interesting theorems on them, which are related to the independent strong edges of the vague competition graphs are investigated.
Abstract: A vague graph is a generalized structure of a fuzzy graph that gives more precision, flexibility and compatibility to a system when compared with systems that are designed using fuzzy graphs. In this paper, some properties of an edge regular vague graph are given. Particularly, strongly regular, edge regular and bi-regular vague graphs are defined and the necessary and sufficient condition for a vague graph to be strongly regular is studied. Likewise, we have introduced a partially edge regular vague graph and fully edge regular vague graph with suitable illustrations. Finally, we gave an application of vague digraph in travel…time.
Show more
Abstract: Theoretical concepts of graphs are highly utilized by computer science applications. Especially in research areas of computer science such as data mining, image segmentation, clustering, image capturing and networking. The interval-valued fuzzy graphs are more flexible and compatible than fuzzy graphs due to the fact that they have many applications in networks. In this paper, at first we define three new operations on interval-valued fuzzy graphs namely strong product, tensor product and lexicographic product. Likewise, we study about the degree of a vertex in interval-valued fuzzy graphs which are obtained from two given interval-valued fuzzy graphs using the operations Cartesian…product, composition, tensor and strong product of two interval-valued fuzzy graphs. These operations are highly utilized by computer science, geometry, algebra, number theory and operation research. In addition to the existing operations these properties will also be helpful to study large interval-valued fuzzy graph as a combination of small, interval-valued fuzzy graphs and to derive its properties from those of the smaller ones.
Show more
Abstract: Fuzzy soft set theory is applied to hyper BCK -algebras. The notion of fuzzy soft positive implicative hyper BCK -ideals is introduced, and several properties are investigated. The relation between fuzzy soft positive implicative hyper BCK -ideal and fuzzy soft hyper BCK -ideal is considered. Characterizations of fuzzy soft positive implicative hyper BCK -ideal are provided. Using the notion of positive implicative hyper BCK -ideal, a fuzzy soft weak (strong) hyper BCK -ideal is established.
Abstract: In this paper, the notions of normal m -dominating set, normal m -domination number, inverse normal domination set (number) and inverse normal m -domination number are introduced, and some the related results are investigated. Finally, a utilization relevant to decision-making based on influencing factors the company’s efficiency is presented.
Keywords: Pythagorean fuzzy graph, normal m-dominating set, normal m-domination number, inverse normal domination set (number), inverse normal m-domination number