connected domination number
Neighborhood and Efficient Triple Connected Domination Number of a Fuzzy Graph
... triple Connected dominatingset, if S is a dominating set and the induced sub graph < N(S) > is a triple ...triple Connected dominating sets is called the Neighborhood triple Connected ...
8
Global outer connected domination number of a graph
... outer connected dominating set if D = V (G) or G − D is ...outer connected domination number of a graph G, denoted by e γ c (G), is the cardinality of ...
9
Restrained Triple Connected Domination Number of Cardinal, Strong and Equivalent Products of Graphs
... triple connected domination number of the product of path graphs as cardinal, strong and equivalent ...triple connected dominating set, if the <S> is triple ...triple connected ...
7
Connected Domination Number of Fuzzy Digraphs
... of domination in fuzzy graphs are introduced by ...on connected dominating set of fuzzy digraph and proves some results based on connected dominating fuzzy ...
5
Connected Domination Number of Fuzzy Digraphs
... of domination in fuzzy graphs are introduced by ...on connected dominating set of fuzzy digraph and proves some results based on connected dominating fuzzy ...
5
Connected domination number on Cartesian product of simple fuzzy graphs
... weak connected with their neighbors. So, construct a connected dominating set in S which cover all vertices in ...therefore, connected dominating set of S contains atmost n ...
12
Tadpole Domination in Graphs M. N. Al-Harere P. A. Khuda Bakhash*
... The domination number of 𝐺 𝛾(𝐺) is the minimum cardinality taken over all dominating sets in G ...of domination parameters through adding conditions on the dominating ...a connected dominating ...
6
Some New kinds of Connected Domination in Intuitionistic Fuzzy Graphs
... The study of domination set in graphs was begun by ore and Berge. The connected domination number was first introduced by E.Sampathkumar and H.B.Walikar[8] Rosenfield[6] introduced the notion ...
6
Total global neighbourhood domination
... the connected dominating set of G. A dominating set D of connected graph G is called a connected dominating set of G if the induced subgraph hDi is ...The connected domination ...
11
A Study on the Normed Graphs and Disemigraphs
... a connected dominating set of if the sub graph is ...the connected dominating sets of is called the connected domination number of and is denoted by ...
6
Some Connected Domination in Fuzzy Soft Graphs
... is connected for each parameter, then S is called fuzzy soft connected dominating ...soft connected dominating set is called the fuzzy soft connected domination number and is ...
7
Vol 4, No 11 (2013)
... the connected domination number is one and the connected dominating set of size two are {1, 2}, {2, 3}, {2, 4}, the connected dominating sets of size three are {1, 2, 3}, {1, 2, 4}, {2, ...
7
Vol 3, No 4 (2012)
... dominating number is Γ e the upper equitable dominating set of ...of connected graph G is called an equitable connected dominating set (ecd-set) if the induced subgraph 〈 〉 S is ...equitable ...
5
Comparison of Roman Domination Number with Domination Number, Independent Domination Number and Chromatic Number of a Graph
... The number of edges incident with a vertex v of a graph is called the degree of v and is denoted by ...be connected if there is a path between every pair of vertices, otherwise it is said to be disconnected ...
7
Vol 10, No 6 (2019)
... p-domination number of G, denoted by γ p (G ) , is the minimum cardinality of p-dominating sets of ...p-reinforcement number of G, denoted by r p (G ) , is the minimum number of edges in ...
6
The 2-Tuple Domination Problem on Circular-arc Graphs
... fields. Domination arises in facility location problems, where the number of facilities ...the number of facilities necessary so that everyone is ...from domination also appear in problems ...
11
Connected Total Global Domination in Fuzzy Graphs
... total global dominating set of G. Then abE(G) . Since S is a fuzzy connected total global dominating set of G, there exists no node joined to both a and b. As S is a dominating set of G each node uV(G) S must ...
6
On Steiner Domination Number of Graphs
... a connected graph G, a set of vertices W in G is called a Steiner dominating set if W is both a Steiner set and a dominating ...Steiner domination numberand is denoted by s (G ) ...Steiner ...
5
K - Domination Number of Butterfly Graphs
... and domination are very important ideas in computer architecture and communication ...important domination parameter k-domination Number for Butterfly ...between domination ...
5
Total Domination Number and Chromatic Number of a Fuzzy Graph
... number of colours required to colour all the vertices such that adjacent vertices do not receive the same colour is the chromatic number (G). For any graph G a complete sub graph of G is called a clique of ...
5