We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Improved Bounds on the k-tuple (Roman) Domination Number of a Graph.
- Authors
Abd Aziz, Noor A'lawiah; Henning, Michael A.; Rad, Nader Jafari; Kamarulhaili, Hailiza
- Abstract
In Henning and Jafari Rad (Graphs Combin, 37: 325–336, 2021), several new probabilistic upper bounds are given on the k-tuple domination number, k-domination number, Roman domination number, and Roman k-domination number of a graph using the well-known Brooks’ Theorem for vertex coloring, improving all of previous given bounds for the above domination variants. In this paper, we use the well-known Turán’s Theorem, and give a slight improvement of all above given bounds.
- Publication
Graphs & Combinatorics, 2022, Vol 38, Issue 3, p1
- ISSN
0911-0119
- Publication type
Article
- DOI
10.1007/s00373-022-02471-5