On Domination and its Forcing in Mycielski's Graphs

Abstract

In this paper, for a given graph, G, some domination parameters and the forcing domination number of the graph, M(G), obtained from G arising in Mycielski's construction, are studied.