[PDF] Top 20 A Study on Fuzzy K-Domination Using Strong Arc

... a fuzzy graph. Two nodes in a fuzzy graph G are said to be fuzzy independent if there is no strong arc between ...minimum fuzzy cardinality of an Independent dominating set of G ... See full document

... of fuzzy subset of a set as a way for representing uncertainty ...discussed fuzzy graph theory fuzzy hypergraph [4]. Fuzzy graph is the generalization of the ordinary ...of domination ... See full document

... Abstract. Fuzzy soft set are introduced by author Molodtsov, which is solve imprecise problems in the field of engineering, social science, economic, medical secience and ...the study of domination ... See full document

... A fuzzy subgraph 𝐻 = (𝜏, 𝜌) is said to be a spanning subgraph of G = (𝜎, 𝜇) if 𝜏(𝑢) = 𝜎(𝑢) for all u in ...same fuzzy node set, but they differ only in the arc ... See full document

... a fuzzy graph adjacent to the pendent vertices is called a support of the pendent ...of fuzzy graph G is a subset K of V such that every effective edge of G has at least one end in ...in K is ... See full document

... The study of dominating sets in graph was introduced by Ore and Berge in ...edge domination was introduced by Arumugam and Velammal ...edge domination problem has many applications in resource ... See full document

... Definition 2.23. [17] Minimum cardinality among all minimal dominating set is called lower-domination number of G, and is denoted by d(G). Maximum cardinality among all minimal dominating set is called ... See full document

... a strong arc}. A subset D of V is called a dominating set of a fuzzy graph G if for every ∈ V− D, there exist # ∈ D such that # dominates ...The domination number, (G), of a fuzzy graph ... See full document

... the fuzzy analogue of several graph theoretic concepts like paths, cycles, trees and connectedness and established some of their properties ...of strong arcs [7]. Different parameters like sum distance in ... 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 such as ... See full document

... a fuzzy regular space. Let U = {( , U ) : X} be a fuzzy open set of X such that Uʹ = ...is fuzzy closed set of X such that Uʹ = ( , 1 – U ) and hence, ...disjoint fuzzy open set V and W such ... See full document

... the study of graphs, which are mathematical structures used to demonstrate pair wise relations between ...of domination, chromatic number and total domination the most often discussed is a ... See full document

... We consider simple, finite, connected and undirected graph G with vertex set V (G) and edge set E (G). For all stan- dard terminology and notations we follow West [20] while the terms related to the theory of ... See full document

... This presents an extension of the standard back propagation algorithm (SBP). The proposed learning algorithm is based on the fuzzy integral of Sugeno and thus called fuzzy back propagation (FBP) algorithm. ... See full document

... a strong complementary acyclic dominating set of ...a strong complementary acyclic dominating set of ...a strong private neighbour in V- S with respect to ...a strong dominating ... See full document

... In general, problems for circular-arc graphs tend to be more difficult than for interval graphs. One of the reasons is that intervals of a real line satisfy the Helly property, while arcs of a circle do not ... See full document

... of fuzzy topology. Ore [7] introduced the concept of domination in theory of ...fundamental domination on graphs and they worked more concepts on domination on ...pythagorean fuzzy ... See full document

... Kulli and Janakiram introduced the concept of strong non-split domination number of a graph [10]. Throughout this paper D=(V,A) is a finite directed graph with neither loops nor multiple arcs(but pairs of ... See full document

... Let G = (V, E) be a graph with n vertices and domination number γ > 1. For two vertices a and b in V , we write a ∼ b or a 6∼ b accordingly as a and b are adjacent or non-adjacent in G. A graph G with ... See full document

... Definition 2.12. Let = (, ) be a bipolar fuzzy graph, if each vertex of has same close neighbourhooddegree ' , then is called a totally regular bipolar fuzzy graph. The closed neighbourhood degree of a ... See full document