A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Further results on complementary perfect domination number of a graph

2013
*
International Mathematical Forum
*

A subset S of V is called a dominating set in G if every vertex in v -S is adjacent to at least one vertex in S. The minimum cardinality taken over all dominating sets in G is called the dominating number of G is denoted by .The conce[pt of complementary perfect domination number of a graph was introduced by Paulraj Joseph. J, Mahadeven. G, Selvam. A in [9] . A subset S of V of a non trivial graph G is said to be complementary perfect dominating set, if S is a dominating set and has a perfect

doi:10.12988/imf.2013.13010
fatcat:dm4k6ccz4nambavyxdhwk7vb7e