%0 Journal Article
%T Graphs with Constant Sum of Domination and Inverse Domination Numbers
%A T. Tamizh Chelvam
%A T. Asir
%J International Journal of Combinatorics
%D 2012
%I Hindawi Publishing Corporation
%R 10.1155/2012/831489
%X A subset D of the vertex set of a graph G, is a dominating set if every vertex in £¿ is adjacent to at least one vertex in D. The domination number () is the minimum cardinality of a dominating set of G. A subset of £¿, which is also a dominating set of G is called an inverse dominating set of G with respect to D. The inverse domination number ­å() is the minimum cardinality of the inverse dominating sets. Domke et al. (2004) characterized connected graphs G with ()
%U http://www.hindawi.com/journals/ijct/2012/831489/