On Computing Domination Set in Intuitionistic Fuzzy Graph
نویسندگان
چکیده
منابع مشابه
A Study on Point Set Domination of Intuitionistic Fuzzy Graphs
Let G = (V,E) be the IFG and D be set of vertices, then D is said to be Intuitionistic point set dominating set of G if for every S⊆ VD there exists a node d ∈ D such that the Intuitionistic fuzzy sub graph < S∪{d} > induced by S∪{d} is a connected Intuitionistic fuzzy graph. In this paper we study some results on Intuitionistic Point set dominating set and its number of IFGs. Also we establish...
متن کاملTotal Semi - μ Strong (Weak) Domination in Intuitionistic Fuzzy Graph
In the initial stage we proposed the concept of Total Strong (Weak) domination in Fuzzy graph. It deal with the real time application that helps a individual person in crossing a road traffic signal. We will be giving a single value for vertices and edges. Enhancing the same concept, the Total Strong (Weak) domination in Intuitionistic Fuzzy graph was proposed. Here we will be giving a double v...
متن کاملEdge Domination on Intuitionistic Fuzzy Graphs
Let D be the minimum dominating set of intuitionistic fuzzy graph G. The minimum intuitionistic fuzzy cardinality of all edge dominating set of intuitionistic fuzzy graph G is known as edge domination number and it is denoted by γe(G). In this Paper, we initiate some definitions onedge dominating set concerning intuitionistic fuzzy sets. Further, we investigate some results onedge domination nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2021
ISSN: ['1875-6883', '1875-6891']
DOI: https://doi.org/10.2991/ijcis.d.210114.002