CONGRUENT DOMINATING SETS IN A GRAPH - A NEW CONCEPT

CONGRUENT DOMINATING SETS IN A GRAPH - A NEW CONCEPT

S. K. Vaidya, H. D. Vadhel

[PDF]

Abstract

A dominating set D   V (G) is said to be a congruent dominating set of G if X v2V (G) d(v)   0 mod X v2D d(v) ! : The minimum cardinality of a minimal congruent dominating set of G is called the con- gruent domination number of G which is denoted by cd(G). Some characterizations are established and congruent domination number for various graphs have been investigated.

Keywords

Dominating Set, Domination Number, Congruence, Congruent Dominating Set, Congruent Domination Number.