minimum connected dominating sets
Vol 7, No 9 (2016)
... a dominating set of G if every vertex in V -S is adjacent to at least one vertex in ...the minimum cardinality taken over all dominating sets in ...A dominating set S of a ...
6
The Upper Total Edge Domination Number of a Graph
... any connected graph , a vertex ∈ ( ) is called a cut vertex of if − is no longer ...a dominating set if each vertex of is dominated by some vertex of ...the minimum cardinality of a dominating ...
6
Minimum Connected Dominating Set based Virtual Backbone Construction in OLSR Protocol
... Relay sets (MPRs) to construct the virtual ...wherein Minimum Connected Dominating Set (MCDS) is used, instead of multipoint relay sets, to construct the virtual ...
9
Vol 8, No 7 (2017)
... a connected simple graph. A restrained convex dominating set 𝑆 in a connected graph 𝐺 is a secure restrained convex dominating set, if for each element 𝑢 in 𝑉(𝐺)\𝑆 there exists an element 𝑣 in ...
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 ...the minimum cardinality of a dominating set in G. A dominating set with ...
10
Tadpole Domination in Graphs M. N. Al-Harere P. A. Khuda Bakhash*
... a dominating set if every vertex 𝑣 ∈ 𝑉 is either an element of 𝐷 or is adjacent to an element of ...the minimum cardinality taken over all dominating sets in G ...the dominating set. ...
6
International Journal of Scientific Research and Reviews The Upper Total Edge Domination Number of a Graph
... any connected graph , a vertex ∈ ( ) is called a cut vertex of if − is no longer ...a dominating set if each vertex of is dominated by some vertex of ...the minimum cardinality of a dominating ...
6
Stability of Connected Dominating Sets in the Presence of Static Nodes in a Mobile Ad hoc Network
... time. Connected dominating sets (CDS) are considered to be an effective topology for network-wide broadcasts in MANETs as only the nodes that are part of the CDS need to broadcast the message and the ...
11
A Study on the Normed Graphs and Disemigraphs
... A dominating set is said to be a connected dominating set of if the sub graph is ...The minimum of the cardinalities of the connected dominating sets of is called the ...
6
Vol 9, No 1 (2018)
... paper, connected accurate edge dominating set of a fuzzy graph is ...edge dominating set D is said to be a connected accurate edge dominating set, if an induced fuzzy subgraph <D> ...
5
Vol 9, No 11 (2018)
... a connected simple graph. A subset 𝑆 of 𝑉(𝐺) is a dominating set of 𝐺 if for every 𝑣 ∈ (𝑉(𝐺)\𝑆), there exists 𝑥 ∈ 𝑆 such that 𝑥𝑣 ∈ ...a dominating set of 𝐺. A graph 𝐺 is connected if there is ...
7
Vol 7, No 11 (2016)
... any connected graph. A subset D of V is called a connected dominating set of G if every vertex 𝑣𝑣 ∈ 𝑉𝑉 − 𝐷𝐷 is adjacent to some vertex in D and < 𝐷𝐷 > is ...A connected dominating ...
5
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
Trees with Unique Minimum Dominating Sets
... unique minimum dominating ...unique minimum domination in ...unique minimum total dominating ...unique minimum paired-dominating ...unique minimum locating ...
5
The Minimum Total Edge Dominating Energy of a Graph
... The minimum covering energy () and minimum dominating energy () of a graph are well known problems of graph ...introduced minimum total edge dominating energy () of a Graph is ...
6
Strong Dominating Sets of Some Arithmetic Graphs
... Clearly, graph is a connected graph. If is a prime, then graph consists of a single vertex. Hence it is connected. In other cases, by the definition of adjacency in there exist edges between prime numbers, ...
5
Independent Double Geodetic Domination Number of a Graph
... any connected graph with at least two vertices. Adouble geodetic dominating set of G is a subset S of V(G) which is both dominating and double geodetic set of ...geodetic dominating set S is ...
5
Graph Neural Network for Minimum Dominating Set
... a minimum dominating set in an undirected graph with a single node of degree ...describes minimum dominating set, Section 3 gives a brief description of GNN, Section 4 explains the generalized ...
5
Inverse and Disjoint Secure Total Domination in Graphs
... a minimum secure dominating set of ...secure dominating set D' of G, then D' is called an inverse secure dominating set with respect to ...
7
(G,D)-Bondage and (G,D)-Nonbondage Number of a Graph
... Definition 2.1: The (G,D)-bondage number of a graph G denoted by b𝛾 𝐺 (𝐺) is the least positive integer 𝑘 such that there exists F ⊆ E(G) with 𝐹 = 𝑘 and 𝛾 𝐺 (𝐺 − 𝐹) > 𝛾 𝐺 (𝐺). If no such 𝑘 exists, it is defined to be ...
6