[PDF] Top 20 A generalised upper bound for the k tuple domination number

... Abstract In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers.. We consider finite [r] ... See full document

... mentioned upper bounds and improve an upper bound proved in ...A generalised upper bound for the k-tuple domination ... See full document

... sharp upper bounds on the Zagreb indices of n-vertex trees with domination number γ and characterized the extremal ...the upper bounds for the Zagreb indices of n-vertex trees with given ... See full document

... an upper bound for the sum of a domination parameter and a graph theoretic parameter and characterized the corresponding extremal ...the upper bound is ...perfect domination ... See full document

... independent domination was formalized by Berge [4] and Ore [14] in ...independent domination number and the notation i(G) were introduced by Cockayne and Hedetniemi in [5, ...sharp upper ... See full document

... The domination number γ(G) is the minimum cardinality of a dominating ...double domination in ...double domination number of G and is denoted by ...minimum number of vertices ... See full document

... integer k, a set S of vertices in a graph G = (V, E) is a k-tuple dominating set of G if every vertex of V − S is adjacent to at least k vertices and every vertex of S is adjacent to at least ... See full document

... the upper bounds (4), (7), (9) and (11) imply randomized algorithms to find corresponding dominating sets in a given graph ...the upper bounds (4), (7), (9) and ...α-rate domination numbers up to a ... See full document

... × k (G ) for a graph G is not easy, many studies focus on its upper ...an upper bound for general graphs in [7], and later Chang [5] improved ...2-tuple domination problem on ... See full document

... si- domination and parametric domination, ...{k}- domination, k-domination, total k-domination and k-tuple ...classical upper bounds are ... See full document

... Software Testing is the emerging and important field of IT industry because without the concept of software testing, there is no quality software which is produced in the industry. Verification and Validation are the two ... See full document

... of domination in graphs evolved from a chess board problem known as the Queen problem- to find the minimum number of queens needed on an 8x8 chess board such that each square is either occupied or attacked ... See full document

... Let = ( , ) be a connected graph of order . The total edge dominating set in a connected graph is called a minimal total edge dominating set if no proper subset of is a total edge dominating set of . The upper ... See full document

... Consider the following hypothetical example. Imagine that you are the curator of an art museum and you wish to determine the minimum number of guards you need to guard the exhibits. Clearly a guard can guard an ... See full document

... In this brief chapter we show that an upper bound on the Fitting length of a group can be obtained in terms of the number of conjugacy classes of its maximal metanilpotent subgroups. In fact, our ... See full document

... called upper domination perfect (Γ-perfect) if β(H) = Γ(H), for every induced subgraph H of G; G is minimal Γ-imperfect if G is not Γ-perfect and β(H) = Γ(H), for every proper induced subgraph H of ... See full document

... a number of methods has been developed to improve the quality of ...relation tuple including employee’s name (FN: first name, LN: last name), work phone (CC: country code, AC: area code, phn: phone ... See full document

... In this section p is a prime number and B(1, n) = {k < n : gcd(k, n) = 1}. Lemma 2.1. Let G be a group and H be a proper subgroup of G such that [G : H ] = t. If S = G \ H , then Cay(G : S) is a ... See full document

... radio k-chromatic number of a graph is an interesting yet difficult combinatorial problem with potential applications to FM channel ...radio k-coloring was introduced by Chartrand et al. in 1 . But so ... See full document

... The number of edges incident with a vertex v of a graph is called the degree of v and is denoted by ...The domination number (G) of the graph G is the minimum cardinality of the dominating set in ... See full document