Dominating Set
Split Restrained Dominating Set of an Interval Graph using an Algorithm
... the set { i 1 , i 2 , , n } and i RDS implies that V RDS does not contain i ...Restrained dominating set of an interval graph towards an algorithm with an illustration as ...
6
GV Ebe a graph. A dominating setDV is an end dominating set if Dcontains all the end
... A set D ⊆ V is a dominating set if every vertex not in D is adjacent to at least one vertex in D . The domination number of G , denoted by γ ( ) G , is the minimum cardinality of a dominating ...
5
A New Algorithm for Finding a Minimum Dominating Set of Graphs
... In the present paper the concept of relative domination power of vertices for finite undirected graphs have been introduced. An algorithm has been developed to obtain a minimum dominating set of a graph. ...
5
Applying Surface Based DNA Computing for Solving the Dominating Set Problem
... The surface-based DNA computing is one of the me- thods of DNA computing which uses DNA strands immobilized on a solid surface. In this paper, we ap- plied surface-based DNA computing for solving the dominating ...
5
Semi Global Dominating Set in Fuzzy Graphs
... Abstract. In this paper, new types of fuzzy graphs are defined and discussed some properties of the defined graphs. Also we defined the semi global fuzzy dominating set and its number of fuzzy graphs. Some ...
8
Graph Neural Network for Minimum Dominating Set
... data set, and pointed out some limitations of Graph Neural Networks when applied to recommender ...connected dominating set in a wireless sensor ...large set of XML formatted ...
5
THE STRONG (WEAK) VV-DOMINATING SET OF A GRAPH
... The set of vertices is said to be an independent set if no two vertices in the set are ...independent set is called independence number 𝛽 0 ...A set of vertices is a dominating ...
10
SV is an equivalence set of G and S is a dominating set of G. The minimum cardinality of a c-e-d set of
... equivalence dominating set of G if S is a complementary equivalence dominating set, and for any v V S there exist u S such that ( S { u }) { v } is a complementary equivalence ...
8
The Comparison of Degree of Complementary Dominating Set of Dominating Set using Euclidean Division Algorithm with Divisor 5 for Interval Graph G
... complementary dominating set of dominating set using Euclidean division algorithm with divisor 5 for interval graph G corresponding to an interval family ...complementary dominating ...
21
Multi Document Summarization via the Minimum Dominating Set
... minimum dominating set have outperformed many existing ...data set to evaluate our method for generic summariza- tion task and DUC05 and DUC06 data sets for query-focused summarization ...data ...
9
Do Almost All Trees Have No Perfect Dominating Set?
... domination set in a graph has wide range of ...perfect dominating set S , then the members of S are independent influencers that will completely influence the entire network, and each non-influencing ...
13
An Algorithmic Approach on Finding Edge Dominating Set of Fuzzy Graph
... Step 2: Choose an edge e ୧ ∈ S − D (arbitrarily) and put e ୧ in D i.e., D = D ∪ {e ୧ } . Step 3: Let the sub matrix B of A be formed by the rows corresponding to the edges in D . Step 4: If the sub matrix B has atleast ...
7
Algorithms for Finding an Efficient Dominating Set of an Interval Graphand a Split Dominating Set of a Circular-Arc Graph
... neighbourhood set of G ...a dominating set of G if every vertex in V D is adjacent to some vertex in D ...a dominating set. A dominating set S of a graph G is called ...
8
The Dominating Set of Bergman Spaces
... Next we will study some applications of Theorem 11. Let φ be a bounded measurable function on . So we want to prove that the Toeplitz operator T φ is bounded. Using dominating set and Carleson measures, ...
12
Line Set Dominating Set with Reference to Degree
... A set D ⊆ V (G ) is said to be a strong point set dominating set (spsd-set) of ...each set S ⊆ V − D , there exists a vertex u ∈ D such that the sub graph S U { } u induced by S ...
6
Solving the k-center Problem Efficiently with a Dominating Set Algorithm
... In the following section we describe a heuristic algorithm for the dominating set problem. In Section 3 we show how this algorithm can be applied to solve the k-center problem. Section 4 briefly gives some ...
9
Vol 3, No 7 (2012)
... A subset D of vertices of a graph connected graph G is called a semi global dominating set(sgd - set) iff D is a dominating set for both G and G sc , where G sc is the sem[r] ...
5
Perfect Domination in Constant Intuitionistic Fuzzy Graph of Degree (ki,kj)
... degree ( , ). Here, every arc is a strong arc in this constant intuitionistic fuzzy graph of degree ( , ), since, ( µ 2 , γ 2 ) is a constant function. Also if for every vertex v∈V-P is dominated by exactly one vertex of ...
9
On (1,2) Blast Domination Number for Some Total Graphs
... Blast dominating set having property that, for every vertex in , there is at least one vertex in at distance 1 from and a second vertex in at distance almost 2 from and also is a connected dominating ...
5
Hop Dominating Sets in Graphs Under Binary Operations
... dominating set of G, denoted by pnd(G), is called the point-wise non-domination number of ...A dominating set S which is also a point-wise non-dominating set of G is called a ...
9