[PDF] Top 20 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 ... See full document

... the domination number and the irredundance number of a graph G, ...< 2 ir(G) for any graph ...cyclomatic number µ(G) ≤ ...length 2 (mod 4), then γ(G)(5π(G) + 4) ≤ ir(G)(8π(G) ... See full document

... Definition 2.14. A subset V of is called a dominating set in if for every ∈ – V, there exist K ∈ V such that K dominates . A dominating set V of a BFG is said to be minimal dominating set if no proper subset of V is a ... See full document

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

... Roman domination called edge Roman star ...star domination number of star graphs, paths, cycles, complete binary trees and Petersen ...edge domination number are presented ... See full document

... The concept of distance two complementary tree dominating set is introduced in [4]. A dominating set D is called a distance two complementary tree dominating set, if for each u ∈V(G) – D, there exists a vertex v ∈ D such ... See full document

... weak domination numbers were investi- gated by Sampathkumar and Pushpa Latha [13] while Bhat et ...the graphs achieving such ...weak domination in fuzzy graphs and provided some examples to ... See full document

... of domination in graphs has been introduced by Berge [1], and continued by several ...on domination in the year ...valued graphs. In [8], we studied the S- valued graphs in ...vertex ... See full document

... characterize 2 regular graphs with X icp and 3 regular graphs with X icp and describe an upper limit for number of vertices in d-regular ...d-regular graphs with X icp (G ) and ... See full document

... a complete fuzzy graph with two nodes ...the 2-dominating set of G. Thus the fuzzy graph G has all the 2 nodes in the 2-dominating set of G and also it will be in the minimum ... See full document

... theory domination and coloring are two popular research areas which have been extensively ...graph domination was introduced by Berge C in 1958 in the name of coefficient of external ...as domination ... See full document

... domination number of a graph G which we denoted by  SR   G is minimum weight of an SRDF on G ...connected graphs of order n with Strong Roman domination numbers 2 n  2 , ... See full document

... i) domination number is less than ( 1, 2 ) – double domination number ...double domination number is less than ( 1, 2 ) – double domination number ... See full document

... 𝑖) In this case the lower bound in Proposition 2.11 does not change since 𝐷 is an independent set. Since the two induced subgraphs 〈𝐷〉 𝑎𝑛𝑑 〈𝑉 − 𝐷〉 can still be null graphs. The upper bound occurs when 〈𝑉 − 𝐷〉 is ... See full document

...   elements. Clearly  Sn (G)   Snsb (G) . Further, we consider a tree which is neither a star nor a path. Assume  (T)  3 , in n (T) each block is complete and every cutvertex of n (G) lies on exactly two ... See full document

... 1 2 2 2 3 3 2 2 1 1 0 1 2 2 2 3 4 3 3 2 1 1 0 1 1 1 2 3 3 3 2 2 2 1 0 2 2 3 4 4 4 3 2 2 1 2 0 ... See full document

... minus domination number equal to zero. The domination in corona and join of graphs are studied by ...total domination number are studied and lower bounds for minus total ... See full document

... in graphs has become an important area of research in graphs as evidenced by the many results contained in two books by Haynes, Hedetniemi and Slater (1998) ...connected graphs. The concept of triple ... See full document

... of domination and split domination, Kavaturi and Vangipuram introduced a new parameter on domination which is said to be annihilator dominating set (ADS) and investigated some results of the ... See full document

... regular graphs. One of the current interests of researchers is Butterfly graphs, because they are studied as a topology of parallel machine ...1, 2, ……n-1} and v = x n-1 x n-2 …… ... See full document