Generalized domination in closure systems
نویسندگان
چکیده
منابع مشابه
Generalized domination in closure systems
In the context of extracting maximal item sets and association rules from a binary data base, the graph-theoretic notion of domination was recently used to characterize the neighborhood of a concept in the corresponding lattice. In this paper, we show that the notion of domination can in fact be extended to any closure operator on a finite universe and be efficiently encoded into propositional ...
متن کاملGeneralized connected domination in graphs
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ c (T ) in terms of minimum valency and diameter. For trees the inequality γ c (T ) ≤ n− k − 1 is known to hold, we determine the class o...
متن کاملGeneralized power domination of graphs
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
متن کاملDomination of generalized Cartesian products
The generalized prism πG of G is the graph consisting of two copies of G, with edges between the copies determined by a permutation π acting on the vertices of G. We define a generalized Cartesian product G π H that corresponds to the Cartesian product G H when π is the identity, and the generalized prism when H is the graph K2. Burger, Mynhardt and Weakley [On the domination number of prisms o...
متن کاملHeredity for generalized power domination
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction. We prove optimal bounds for γP,k(G − e), γP,k(G/e) and for γP,k(G − v) in terms of γP,k(G), and give examples for which these bounds are tight. We characterize all graphs for which γP,k(G− e) = γP,k(G) + 1 for any edge e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2006
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.04.009