Inverse Double Domination in Graphs

Main Article Content

Vinodh Kumar A. R. , Sathish T. , Reshma S .P.

Abstract

A vertex set  is a double – dominating set, if each vertex  is adjacent to at least two vertices in . The minimum cardinality of a double dominating set of G, denoted by  is called the double domination number of G.


A double dominating set S of a graph  is an inverse double dominating set, if  contains a double dominating set say of . Then  is called an inverse double dominating set. The inverse double domination number  of  is the minimum cardinality of an inverse double dominating set.


In this paper, we obtain exact value of  for some standard graphs and also, we establish some general results on this parameters.


DOI: https://doi.org/10.52783/tjjpt.v45.i03.7347

Article Details

Section
Articles