dominating sets
Edge Vertex Dominating Sets and Edge Vertex Domination Polynomials of Cycles
... Edge-Vertex Dominating Sets of Cycles Let Dev Cn , i be the family of ev-dominating sets of Cn with cardinality i.. We investigate the ev-dominating sets of Cn.[r] ...
14
A Review on Graphs with Unique Minimum Dominating Sets
... A dominating set for a graph G is a subset D of V such that every vertex not in D is adjacent to at least one member of ...minimum dominating sets. We also find a unique minimum dominating ...
6
Stability of Connected Dominating Sets in the Presence of Static Nodes in a Mobile Ad hoc Network
... connected dominating sets (CDS), typically considered the graph-theoretic equivalent for a communication topology that can facilitate network-wide ...
11
Strong Dominating Sets of Lexicographic Product Graph of Cayley Graphs with Arithmetic Graphs
... present. Dominating sets play an important role in practical applications, such as logistics and networks design, mobile computing, resource allocation and telecommunication ...
5
Dominating Sets and Domination Polynomials of Paths
... a dominating set of G, if NS V , or equivalently, every vertex in V \S is adjacent to at least one vertex in ...a dominating set in G. A dominating set with cardinality γG is called a γ-set, and the ...
10
A Face Change of Monophonic Dominating Sets by Non adjacency in Graphs
... Abstract:The concept of an independent domination number (id-number in short) of a graph is related to the movements of a chessboard. In this paper, we extend the notion of id-number into an independent monophonic ...
5
CONSTRUCTING MINIMAL ADJACENT DOMINATING SETS IN SEMIGRAPHS FOR CLUSTERING IN WIRELESS NETWORKS
... Connected Dominating Set (CDS) of graphs in which each node in the cluster wireless network cover via dominating neighbors, define many dominating sets such as strongly connected ...
8
Strong Dominating Sets of Some Arithmetic Graphs
... strong dominating sets of these Arithmetic ...strong dominating sets of product graphs of these graphs and the authors have also studied this ...
5
Trees with Unique Minimum Dominating Sets
... The literature on domination and its variations in graphs has been surveyed and detailed in the two books by Haynes, Hedetniemi, and Slater [1, 2]. Gunther, Hartnell, Markus, and Rall [3] have studied graphs with unique ...
5
A Note on Chromatic Weak Dominating Sets in Graphs
... weak dominating set (or cwd-set) if D is a weak dominating set and χ(< D >) = ...weak dominating set in a graph G is called the chromatic weak domination number (or cwd-number) and is denoted ...
12
A self-stabilizing protocol for minimal weighted dominating sets in arbitrary networks
... Vivacqua A Role-Playing-Game Approach to Accomplishing Daily Tasks to Improve Health 350 João Paulo Santos Da Silva, Daniel Schneider, Jano de Souza and Marcio Antelio Da Silva Multi-vie[r] ...
12
Matching Dominating Sets of Direct Product Graphs of Cayley Graphs with Arithmetic Graphs
... Then the direct product of these two graphs denoted by is defined to be a graph with vertex set , where is the Cartesian product of the sets and such that any two distinct vertices and o[r] ...
6
Strong Dominating Sets of Direct Product Graph of Cayley Graphs with Arithmetic Graphs
... We now show that is minimal. Suppose we delete a vertex, say from Obviously this vertex is not dominated by any vertex in as are primes, there is no adjacency between these vertices in Therefore can’t be a ...
7
Hop Dominating Sets in Graphs Under Binary Operations
... Proof. Suppose G admits a total hop dominating set, say S. Suppose further that there exists a component C of G such that γ (C) = 1. Let v ∈ V (C) be such that {v} is a dominating set of C. Since S is a hop ...
9
Results on Relatively Prime Dominating Sets in Graphs
... prime dominating set of a graph ...prime dominating set if it is a dominating set with at least two elements and for every pair of vertices u and v in S such that (deg u, deg v) = ...prime ...
11
A Study on the Normed Graphs and Disemigraphs
... connected dominating set, if is a dominating set and the sub graph is triple ...connected dominating sets of is called the triple connected domination number of and is denoted by ...
6
Distance Closed Domatic Number of Graphs
... study of the distance closed dominating sets in graphs are studied in [6].In this paper,the distance closed domatic number of some special classes of graphs are studied.Also, a general algorithm to find the ...
6
SPLIT AND NON SPLIT TWO DOMINATION NUMBER OF A GRAPH Dr. A. Mydeen Bibi
... a dominating set in G if every vertex in V-S is adjacent to atleast one vertex in ...all dominating sets in G is called the domination number of G and is denoted ...by.A dominating set is ...
7
An Algorithmic Approach on Finding Edge Dominating Set of Fuzzy Graph
... We defined strong adjacency matrix of a fuzzy graph. Some properties of strong adjacency matrix are also given. Using this strong adjacency matrix we formulated two algorithm one to find the edge dominating ...
7
(G,D)-Bondage and (G,D)-Nonbondage Number of a Graph
... A dominating set of a graph G is a set D of vertices of G such that every vertex in V–D is adjacent to atleast one vertex in D and the minimum cardinality among all dominating sets is called the ...
6