1. Some bounds for the captive domination number of graphs.
- Author
-
Shaveisi, Farzad and Moshtagh, Hossein
- Subjects
- *
ALGEBRAIC numbers , *DOMINATING set , *MATHEMATICS , *ALGORITHMS - Abstract
A proper subset X of vertices in the graph G is a captive dominating set if it is a total dominating set and each vertex in X dominates at least one vertex which does not belong to X ; also, the captive domination number of G , denoted by γ ca (G) , is the cardinality of a minimum captive dominating set of G. In [M. N. Al-Harere, A. A. Omran and A. T. Breesam, Captive domination in graphs, Discrete Math. Algorithms Appl. 12(6) (2020) 2050076], Al-Harere et al., presented some lower and upper bounds for the captive domination number of G , using the number of vertices and edges. Here, we present some upper bounds for γ ca (G) , using independence number and clique number. Also, the captive domination number of split graphs is studied. Among other results, some lower bounds for the captive domination number, in terms of maximum degree and the number of vertices with maximum degree, are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF