strength of strongest dominating sets in fuzzy graphs

a set s of vertices in a graph g=(v,e) is a dominating set of g if every vertex of v-s is adjacent to some vertex of s. for an integer k≥1, a set s of vertices is a k-step dominating set if any vertex of g is at distance k from some vertex of s. in this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongest dominating set as well as strength of strongest k-step dominating set in fuzzy graphs. we determine various bounds for these parameters in fuzzy graphs. we also determine the strength of strongest dominating set in some families of fuzzy graphs including complete fuzzy graphs and complete bipartite fuzzy graphs.