Secure domination number
Secure Domination Polynomials Of Paths
... a secure dominating set if for each u V S there exists v N u S such that S v u is a dominating ...The secure domination number s G is the minimum cardinality ...
5
Inverse and Disjoint Secure Total Domination in Graphs
... minimum secure dominating set of G. If V – D contains a secure dominating set D' of G, then D' is called an inverse secure dominating set with respect to ...inverse secure domination ...
7
Secure Edge Domination in Graphs
... The domination number γ(G) of G is the minimum cardinality of a dominating set of ...many domination parameters are given in the books by Kulli in [2, 3, ...edge domination number γ'(G) ...
5
The Split Majority Domination Number of a Graph
... Definition 2.1. A majority dominating set D ⊆ V(G) is said to be split majority dominating set if the induced sub graph < V – D > is disconnected. A split majority dominating set D is minimal if no proper subset of ...
10
The Disjoint Total Domination Number of a Graph
... the closed neighborhood of S is N[S] = N(S) ∪ S. A set D ⊆ V is a dominating set if every vertex in V – D adjacent to a vertex in D, that is N[D] = V. The domination number γ(G) of G is the minimum ...
6
On the k-Metro Domination Number of Paths
... Metro domination number introduced by Sooryanarayana and Raghunath [5]. Fink and Jacobson [6, 7] in 1985 introduced the concept of multiple domination. A subset D of V (G) is k-dominating in G if ...
8
The k tuple domination number revisited
... and maximum degrees of vertices of G, respectively. Put δ = δ(G) and ∆ = ∆(G). A set X is called a dominating set if every vertex not in X is adjacent to a vertex in X. The minimum cardinality of a dominating set of G is ...
7
On The K- Metro Domination Number of Cycle
... Metro Domination number introduced by B.Sooryanarayana, Raghunath. [5]. Fink and Ja-cobson [9] , [10] in 1985 introduced the concept of multiple domination. A subset D of V (G) is K- dominating in G ...
6
Connected Domination Number of Fuzzy Digraphs
... The Fuzzy Directed Graph, Fuzzy competition digraphs are well known topic.The concept of domination in fuzzy graphs are introduced by A. Somasundaram and S. Somasundaram [] in 1998. In this paper we analyze bounds ...
5
Triple Domination Number of a Butterfly Graph
... By the symmetric structure of BF(n), the domination number must be even. Therefore │S│ is even. Suppose │ S│= 14. Then by symmetry 7 vertices in the left copy and 7 vertices in the right copy are selected. ...
5
Non Split Domination on Intuitionistic Fuzzy Graphs
... If G is an Intuitionistic fuzzy graph with degree of each node is equal. : Let G be an Intuitionistic fuzzy graph with all nodes of equal degree. Here atleast one node has all its edges strong. Also adjacent vertexes of ...
12
A Note on Global Bipartite Domination in Graphs
... Definition 2.1. Let G be a connected bipartite graph with bipartition ( X, Y ) , with | X | = m and | Y | = n. The relative complement of G in K m,n denoted by G is the graph obtained by deleting all edges of G from K b ...
5
Complementary Tree Domination number and Distance two Complementary Tree Domination number of Cartesian Product of Graphs
... The domination number γ (G) of G is the minimum cardinality of a dominating ...tree domination number of G and is denoted by γ ctd (G) ...tree domination number of G and is ...
9
Connected Domination Number of Fuzzy Digraphs
... The Fuzzy Directed Graph, Fuzzy competition digraphs are well known topic.The concept of domination in fuzzy graphs are introduced by A. Somasundaram and S. Somasundaram [] in 1998. In this paper we analyze bounds ...
5
A Review on Lower Bounds for the Domination Number
... of domination in graphs originated around 1850 with the problems of placing minimum number of queens on an n × n chessboard so as to cover or dominate every ...of domination in graphs introduced by ...
5
Secure Complementary Tree Domination Number of a Graph
... a secure complementary tree dominating set of G and for each vertex v in D, one of the four stated conditions ...minimal secure complementary tree dominating set of ...minimal secure complementary ...
5
Total Domination Number and Chromatic Number of a Fuzzy Graph
... Several authors have studied the problem of obtaining an upper bound for the sum of a domination parameter and a graph theoretic parameter and characterized the corresponding extremal graphs. In [10], Paulraj ...
5
The Ratio of the Irredundance Number and the Domination Number for Block Cactus Graphs
... no cut vertex is called a block. A block of a graph G is a subgraph of G which is itself a block and which is maximal with respect to that property. A block H of G is called an end block of G if H has at most one cut ...
10
On the 2 Domination Number of Complete Grid Graphs
... Fink and Jacobson [2] [3] in 1985 to introduced the concept of multiple domination. A subset D ⊆ V is k-dominating in G if every vertex of V – D has at least k neighbors in D. The cardinality of a minimum ...
19
Domination Number in Sierpriński 4-Cycle Graph
... The curiosity for thesegraphs comes from many diverse sources such as games like the Chinese ringsor the Hanoi Tower, physics, topology the study of interconnection systems,a[r] ...
8