[PDF] Top 20 Some Connectivity Concepts in Bipolar Fuzzy Graphs

... Definition 2.17. Let 1, be any two vertices in a connected bipolar fuzzy graph. Among all 1 − paths in , a path whose gain is more than or equal to that of any other 1 − path in , is said to be a maximum 1 ... See full document

... regular bipolar fuzzy ...of bipolar fuzzy line graphs and presents some of their properties ...irregular bipolar fuzzy graphs ...interval-valued fuzzy ... See full document

... new connectivity concepts in intuitionistic fuzzy labeling graphs and we have defined strong arc, partial cut node, bridge and block by connectivity concepts of intuitionistic ... See full document

... A fuzzy set theory was introduced by Zadeh (1965). Fuzzy set theory has become a vigorous area of research in different disciplines including mathematics, physics, statistics, engineering and computer ... See full document

... Abstract. Bipolar fuzzy set theory provides a basis for bipolar cognitive modeling and multiagent decision analysis, where in some situations, the product operator may be preferred to the min ... See full document

... introduced some operations on fuzzy graphs. The complement of a fuzzy graph was defined by Mordeson ...M-strong fuzzy graphs in [5] and studied some of their ... See full document

... BFGs are the precise models of all kinds of networks. As the reduction in the strength of connectedness is more important than the total disconnection of the network, this new concept can be applied to study the ... See full document

... Intersection graphs introduced by Pal [9] also exhibit an important relation between communication system and graph ...theory. Connectivity is one main concept underlying applications of weighted ... See full document

... Abstract. Connectivity has important role in the area of applications of fuzzy graphs such as fuzzy neural networks and ...for connectivity of a bipolar fuzzy graph and ... See full document

... the concepts of edge regular and totally edge regular bipolar fuzzy ...regular bipolar fuzzy graph and totally edge regular bipolar fuzzy graph are ...equivalent. ... See full document

... of fuzzy graphs, obtaining analogs of several graph theoretical ...gave some remarks on fuzzy graphs, and some operations on fuzzy graphs were introduced by ... See full document

... of fuzzy graphs whose basic idea was introduced by Kauffman [18] in ...The fuzzy relation between fuzzy sets were also considered by Rosenfeld and he developed the structure of fuzzy ... See full document

... of fuzzy graphs and ...two fuzzy graphs was defined by Mordeson and Peng ...developed some remarks on fuzzy ...generalized bipolar fuzzy ...intuitionistic ... See full document

... the fuzzy analogues of several basic graph-theoretic concepts like bridges, paths, cycles, trees and connectedness and established some of their ...in fuzzy graphs and based on this µ- ... See full document

... of bipolar fuzzy sets which is an generalization of the fuzzy ...Recently bipolar fuzzy models have been studied by many authors on algebraic structures such as; Chen ...those ... See full document

... study some properties of bipolar-valued fuzzy ideals of ring and prove some results of ...the some important theorems prime ideal, subrings and commutative subrings are applied into the ... See full document

... Suppose G is not a neigbourly pseudo totally irregular bipolar fuzzy graph. Then atleast one pair of adjacent vertices in G with same total pseudo degree ⇒ tda(u1) = tda(u2) ⇒ da(u1) + A(u1) = da(u2) + ... See full document

... Atom-bond connectivity index, Randić connectivity index Correspondence to Author: Mohammad Reza Farahani Department of Applied Mathematics, Iran University of Science and Technology, (IUST) Narmak, Tehran ... See full document

... of bipolar fuzzy sub-algebra and bipolar fuzzy ideals of ...a bipolar fuzzy soft G- modules and bipolar fuzzy soft ...a bipolar fuzzy soft G-modules ... See full document

... By a graph means a set of vertices and edges which denotes by V(G) and E(G), respectively. If e is an edge of G, connecting the vertices u and v, then we write e = uv and say "u and v are adjacent". A connected ... See full document