Abstract

In this paper, a new definition of graph domination called “Captive Domination” is introduced. The proper subset of the vertices of a graph [Formula: see text] is a captive dominating set if it is a total dominating set and each vertex in this set dominates at least one vertex which doesn’t belong to the dominating set. The inverse captive domination is also introduced. The lower and upper bounds for the number of edges of the graph are presented by using the captive domination number. Moreover, the lower and upper bounds for the captive domination number are found by using the number of vertices. The condition when the total domination and captive domination number are equal to two is discussed and obtained results. The captive domination in complement graphs is discussed. Finally, the captive dominating set of paths and cycles are determined.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call