Domination in graphs
Strong line domination in graphs
... independent domination number of a graph is the minimum cardinality of an independent dominating set (Haynes et ...split domination number of graph is the minimum cardinality of a strong split dominating ...
6
On total domination and total equitable domination in graphs
... of domination has been remained in the focus of many researchers because of its applications in variety of fields such as linear algebra, optimization, social science, de- sign of communication networks and ...
6
Strong LICT Domination in Graphs
... the domination number of and is denoted by ( ...connected domination number ( ) of is the minimum cardinality of a connected dominating set of ...restrained domination number of a lict graph ( ) is ...
10
Inverse and Disjoint Restrained Domination in Graphs
... A dominating set D in G is a restrained dominating set if the induced subgraph 〈V – D〉 has no isolated vertices. Alternately, a set D ⊆ V is a restrained dominating set if every vertex not in D is adjacent to a vertex in ...
8
Strong Efficient Domination In Graphs
... Let G = (V, E) be a simple graph. E. Sampathkumar and L.Pushpalatha introduced the concepts of strong and weak domination in graphs [5]. In this paper, this concept is extended to efficient ...
6
Fuzzy Topologized Domination In Graphs
... of domination in graphs is very rich both in theoretical developments and ...topologized domination graph into fuzzy topologized domination graph and also established some general ...
6
About ve-Domination in Graphs
... In this paper, there is no restriction on the induced subgraph of the ve-dominating set. We may get new variants of ve-domination by requiring that the ve-dominating set is either an independent set or without ...
6
Hn-Domination in Graphs
... the domination number of 𝐺 and denoted by 𝛾(𝐺) ...of domination number of a graph appeared was in ...on domination in graphs like (7, 8, 9, ...hn- domination number are stated. Also, ...
6
More on Perfect Roman Domination in Graphs
... Throughout this paper, all graphs considered are finite, simple and undirected. Let G = (V (G), E (G) be a graph. The sets V (G) and E(G) are the vertex set and edge set, respectively, of G. For S ⊆ V (G), |S| is ...
20
Discrepancy and signed domination in graphs and hypergraphs
... of graphs by considering the neighbourhood hypergraph of a given ...signed domination function of a graph G is a two-colouring of the vertices of G with colours +1 and –1 such that the closed neighbourhood ...
12
On Roman, Global and Restrained Domination in Graphs
... Another variant of the domination number, the Roman domination number, was introduced by Stewart [16]. In [16] and [14], a Roman dominating function (RDF) of a graph G is defined as a function f : V (G) → ...
12
Changing and Unchanging of Minus Domination in Graphs
... The domination number of G denoted by ( G ) , equals minimum cardinality of a dominating ...of domination like roman domination, total domination, restrained domination, etc have been ...
12
Degree equitable line domination in graphs
... the domination number of G and is denoted by G ...total domination number of G , denoted by t G is the minimum cardinality of total dominating set of G ...
10
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) of G is the ...
5
Practical Application of Some Domination in Graphs
... In Figure 4, the shaded vertices correspond to the location while the edges correspond to the existing road connecting two locations. Suppose a basic social service (BSS) will be constructed in some locations. Since the ...
11
(1, 2) Double Domination in Graphs
... i) domination number is less than ( 1, 2 ) – double domination number ...double domination number is less than ( 1, 2 ) – double domination number ...– domination number is less than ( ...
7
Endedge block domination in graphs
... dominating set of G. Endedge domination is introduced by M.H.Muddebihal and A.R.Sedamkar [3]. A block graph B (G ) is a graph whose vertices are corresponding to the blocks of G and two vertices in B (G ) are ...
10
BD–Domination in Graphs
... Abstract. A vertex v is a boundary vertex of u if d(u, w) ≤ d(u, v) for all w ∈ N(v). A vertex u have more than one boundary vertex at different distance levels. A vertex v is called a boundary neighbour of u if v is a ...
6
On Semitotal Domination in Graphs
... there exists u ∈ S such that uv ∈ E(G). The minimum cardinality of a dominating set in G, denoted by γ(G), is the domination number of G. Provided that G has no isolated vertices, a set S ⊆ V (G) is a total ...
16
Strong Perfect Domination in Graphs
... By a graph, it is meant that a finite, undirected graph without loops and multiple edges. Let G be a graph with vertex V and edge set E. Let p = |V (G)| and q = |E (G)|. The minimum and maximum degrees of vertices in G ...
5