[PDF] Top 20 Strong LICT Domination in Graphs

... a strong split dominating set if the induced subgraph〈 − 〉 is totally disconnected with at least two ...The strong split domination number ( ) of graph is the minimum cardinality of a strong ... See full document

... A precise notion of a dominating set, that is present in the current literature can be said to be given by Berge (1962) and Ore (1962). Since then a number of graph theorists, Allan and Laskar (1978) Allan et al., ... See full document

... of Strong Roman domination is introduced by ...of domination and its parameters dependent, determine the graph that is the number of that parameter is ...all graphs with total ... See full document

... In (Kiruthiga Deepa, 2016) we have defined the terms ev weight m dominating set, in which we have considered the weight of edges which dominates the weight of the vertices belonging to the spanning sub graph of N S (e). ... See full document

... discussed domination in fuzzy graphs. They defined domination using effective edges in fuzzy ...discussed domination in fuzzy graph using strong ...discussed domination, ... See full document

... Throughout this paper, only finite, undirected and simple graphs are considered. The concept of domination in graphs was introduced by Ore. Two volumes on domination have been published by ... See full document

... The domination number𝛾(G) of G is the minimum cardinality of the dominating set of ...of domination in graphs and its advanced topics are given in ...defined strong(weak) domination in ... See full document

... connected domination number of the product of path graphs as cardinal, strong and equivalent ...connected domination number and is denoted by ߛ rtc ...the domination numbers of ܲ ௠ ܲ ௡ ... See full document

... of graphs G and H is the graph with vertex set V(G) V(H) × and edge set is ( , )( , ) u a v b ∈ E G H ( × ) if and only if uv ∈ E G ( ) and ab ∈ E H ( ) ...two graphs G and H is the graph G ⋈ H with ... See full document

... of strong efficient domination. The maximum cardinality of any strong efficient dominating set of G is called the upper strong efficient domination number of G and is denoted by Γ R se ... See full document

... the strong geodetic problem. Here the domination concept is combined with strong geodetic concept resulting in Strong geodetic domination of graphs and few results are ... See full document

... minimal Strong line dominating set of and there exists a vertex such that does not hold any of the above ...a Strong line dominating set of by the conditions (a) and ...a Strong line dominating set ... See full document

... Proof. Let 𝐷 = {𝑢 1 , 𝑢 2 , … . . 𝑢 𝑛 } be a minimum strong vertex dominating set of G. Arrange the elements of D such that 𝑑 𝑠 (𝑢 𝑖 ) ≤ 𝑑 𝑠 (𝑢 𝑖+1 ). Since D is minimal, 𝑑 𝑠 (𝑢 𝑖 ) ≠ 0 for 1 ≤ 𝑖 ≤ 𝑛. Also, since ... See full document

... 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 ... See full document

... of strong non-split domination in directed graph D has been introduced by considering the dominating set S is a strong non-split dominating set if the complement of S is complete A dominating set S ... See full document

... the strong line set dominating number of G and is denote by ϑ sl ' ( G ) ...paper Strong Line set Dominating set are analyse with respect to the strong domination parameter for separable ... See full document

... We consider simple, finite, connected and undirected graph G with vertex set V (G) and edge set E (G). For all stan- dard terminology and notations we follow West [20] while the terms related to the theory of ... See full document

... N [X] = N (X) ∪ X. Denote by δ = δ(G) and ∆ = ∆(G) the minimum and maximum degrees of vertices of G, respectively. The following well-known definitions can be found in [13]. A set X is called a dominating set if every ... See full document

... 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, ... See full document

... 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 ... See full document