CO-REGULAR SPLIT DOMINATION IN GRAPHS
Keywords:
Dominating set /Split domination / Total domination/ Regular domination / Coregular split dominationAbstract
In this paper, we introduce the new concept in domination theory. A dominating set �㔷 ⊆
�㕉(�㔺) is a coregular split dominating set if the induced subgraph < �㕉 − �㔷 > is regular and disconnected.
The minimum cardinality of such a set is called a coregular split domination number and is denoted by
�㗾௦(�㔺). Also we study the graph theoretic property of �㗾௦(�㔺) and many bounds were obtained interms
of �㔺 and its relationship with other domination parameters were found.