Certified Domination Number in Product of Graphs
S. Durai Raj, S.G. Shiji Kumari · Turkish Journal of Computer and Mathematics Education (TURCOMAT) · 2020
A set S of vertices in G = (V, E) is called a dominating set of G if every vertex not in Shas at least one neighbour in S. A dominating set S of a graph G is said to be a certifieddominating set of G if every vertex in S has either zero or at least two neighbours in