[PDF] Top 20 Intuitionistic Fuzzy Soft Graph

... of intuitionistic fuzzy soft graph, strong intuitionistic fuzzy soft graph, complete intutionistic fuzzy soft graph in this ...two ... See full document

... evidence, fuzzy set, intuitionistic fuzzy set, vague set for dealing uncertainties but they have their own ...of fuzzy soft set theory is one of the recent topics developed for dealing ... See full document

... Definition 2.11: Let (F,A) and (G,B) be two intuitionistic fuzzy soft sets over the same common universe U such that A∩ 𝐵 ≠ 0. Then the intersection of (F,A) and (G,B) is denoted by „(F,A) ∪ (G,B)‟ ... See full document

... regular intuitionistic fuzzy dominating set is called regular intuitionistic fuzzy dominating number and denoted by γ rif (G ) = ...regular intuitionistic fuzzy dominating set if ... See full document

... reluctant intuitionistic anti- fuzzy soft commutative ideals with example and proved that every reluctant intuitionistic anti-fuzzy soft commutative ideal is a reluctant ... See full document

... Abstract. In this paper we introduce the notion of product of two interval valued intuitionistic fuzzy graphs and investigate some of their properties. We discuss some propositions on Cartesian product and ... See full document

... of fuzzy sets [13], theory of intuitionistic fuzzy sets [4], theory of vague sets [7], theory of interval mathematics [8], and theory of rough sets [11] which were considered best mathematical tools ... See full document

... of fuzzy matrices is associative, if conformability is assured that is A(BC) = (AB)C if A, B, C are 𝑚 × 𝑛, 𝑛 × 𝑝, 𝑝 × 𝑞 matrices ...complementation fuzzy matrices in our ...of fuzzy matrices ... See full document

... of graph theory. The graph theory is a very useful tool for solving combinatorial problems in different areas such as operations research, optimization, topology, geometry, number theory, algebra and ... See full document

... a graph G by V (G) and E(G) ...A graph G is regular if all its vertices have the same ...A graph is called pseudo-regular if every vertex of G has equal average degree ... See full document

... A graph G: (σ, µ) is said to be fuzzy labeling graph, if σ: V → [0, l] and µ: V × V → [0, l] are bijective such that the membership value of nodes and edges are distinct and µ(x, y) ≤ σ(x) /\ σ(y) ... See full document

... REMARK 7.1: A solution to any transportation problem will contain exactly (m+n-1) basic feasible solutions. The allotted value should be some positive integer or zero, but the solution obtained may be an integer or ... See full document

... M.G.Karunambigai and R.Parvathi, Intuitionistic Fuzzy Graphs, Proceedings of 9 th Fuzzy Days International Conference on Computational Intelligence, Advances in Soft Computing, Computati[r] ... See full document

... of fuzzy graphs was proposed by Kafmann, from the fuzzy relations introduced by ...including fuzzy vertex and fuzzy edges, and several fuzzy analogs of graph theoretic concepts ... See full document

... complex intuitionistic flexible fuzzy soft semi groups and itsCartesian product with the help of suitable ...complex intuitionistic flexible fuzzy soft left (respectively right) ... See full document

... a fuzzy subset of a set as a method for representing ...of fuzzy graphs. Atanassov [1] introduced the concept of intuitionistic fuzzy relation and intuitionistic fuzzy ... See full document

... of fuzzy soft set with some properties regarding fuzzy soft union, intersection, complement of fuzzy soft ...extended soft sets to intuitionistic fuzzy ... See full document

... Ganji [6], in a more general case, investigated Bayes estimation of parameters of generalized negative binomial distribution and it’s applications; he has fixed the parameter k and then [r] ... See full document

... using Intuitionistic fuzzy soft matrices ...a Intuitionistic Fuzzy soft matrices are ...apply Intuitionistic fuzzy soft set theory to develop a ... See full document

... an intuitionistic fuzzy graph- based structure to maintain the corresponding information of every ...such graph structures reduces our correspondence problem to a subgraph finest isomorphism ... See full document