Affiliation:
1. The Faculty of Mathematics and Applied Physics, Rzeszów University of Technology, al. Powstańców Warszawy 12, 35-959 Rzeszów, Poland
Abstract
In 2013 the concept of [j,k]-dominating sets in graphs have been introduced as an extension of [1,k]-dominating sets. Regarding studying [j,k]-dominating sets, the research is also interesting if the additional independence requirement is assumed, because the existence of independent [1,k]-dominating sets is an NP-complete problem in general case. Inspired by this topic, in this paper we study the problem of the existence of independent [j,k]-dominating sets in a special, multi-argument graph product. We give the complete characterization of the generalized corona G∘hn with an independent [j,k]-dominating set, for arbitrary positive integers j and k, which generalize the known result for a corona of two graphs.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference41 articles.
1. Diesel, R. (2005). Graph Theory, Springer. [3rd ed.].
2. Haynes, T.W., Hedetniemi, S.T., and Slater, P.J. (1998). Fundamentals of Domination in Graphs, Marcel Dekker, Inc.
3. von Neumann, J., and Morgenstern, O. (1953). Theory of Games and Economic Behavior, Princeton University Press.
4. Berge, C. (1973). Graphs and Hypergraphs, North-Holland.
5. On the k-stable and k-dominating sets of graphs;Borowiecki;Proc. Graphs, Hypergraphs Block Syst.,1976