Paired domination for some simple graphs
S. Sangeetha, M. Swarnamalya · AIP conference proceedings · 2019
A dominating set D of any graph G (simple and connected) is a set in which each vertex in V-D is adjacent to atleast one vertex in D. The number of vertices in the dominating set with minimum cardinality is called domination number and it is denoted as γ (G). In this paper we have obtained paired domination number for some simple graphs.