Abstract
Let G be a connected graph of order n with vertex set V(G). For positive integers a and b, a subset \(S\subseteq V(G)\) is an (a, b)-dominating set if every vertex \(v\in S\) is adjacent to at least a vertices inside S and every vertex \(v\in V{\setminus } S\) is adjacent to at least b vertices inside S. The minimum cardinality of an (a, b)-dominating set for G is called the (a, b)-domination number of G and is denoted by \(\gamma _{a,b}(G)\). There are various results on upper bounds for \(\gamma _{a,b}(G)\) when G is a regular graph or a and b are small numbers. In the first part of this paper, for a given graph G with the minimum degree of at least \(\max \{a,b\}\), we define a new graph \(G'\) associated to G and show that the independence number of this graph is related to \(\gamma _{a,b}(G)\). In the next part, using Lovász local lemma, we give a randomized approach to improve previous results on the upper bounds for \(\gamma _{a,b}(G)\) in some special cases.
Similar content being viewed by others
References
Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (1998)
Haynes, T.W., Hedetniemi, S., Slater, P.J.: Fundamentals of domination in graphs. In: Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, Inc., New York (1998)
Chang, G.J.: Algorithmic Aspects of Domination in Graphs. In: Handbook of combinatorial optimization, pp. 1811–1877. Springer, New York (1998)
Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Heidelberg (1999)
Liao, C.-S., Chang, G.J.: Algorithmic aspect of \(k\)-tuple domination in graphs. Taiwan. J. Math. 6(3), 415–420 (2002)
Liao, C.-S., Chang, G.J.: k-tuple domination in graphs. Inf. Process. Lett. 87(1), 45–50 (2003)
Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2), 75–83 (2004)
Harary, F., Haynes, T.W.: Nordhaus-Gaddum inequalities for domination in graphs. Discr. Math. 155(1–3), 99–105 (1996)
Henning, M.A., Yeo, A.: Strong transversals in hypergraphs and double total domination in graphs. SIAM J. Discr. Math. 24(4), 1336–1355 (2010)
Chang, G.J.: The upper bound on k-tuple domination numbers of graphs. Eur. J. Combin. 29(5), 1333–1336 (2008)
Kazemi, A.P.: A note on the \(k\)-tuple total domination number of a graph. Tbilisi Math. J. 8(2), 281–286 (2015)
Alipour, S., Jafari, A., Saghafian, M.: On \(k\)-tuple and \(k\)-tuple total domination of regular graphs. arXiv:1709.01245 (2017)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Alipour, S., Jafari, A. Upper Bounds for the Domination Numbers of Graphs Using Turán’s Theorem and Lovász Local Lemma. Graphs and Combinatorics 35, 1153–1160 (2019). https://doi.org/10.1007/s00373-019-02065-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-019-02065-8