Certified Domination Number in Product of Graphs

Main Article Content

S. Durai Raj, S.G. Shiji Kumari

Abstract

A set S of vertices in G = (V, E) is called a dominating set of G if every vertex not in S
has at least one neighbour in S. A dominating set S of a graph G is said to be a certified
dominating set of G if every vertex in S has either zero or at least two neighbours in

Article Details

Section
Articles