On Domination and its Forcing in Mycielski's Graphs

Author

Department of Mathematics,University of Mazandaran

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.

Volume 15, Issue 2 - Serial Number 2
Transactions on Computer Science & Engineering and Electrical Engineering (D)
April 2008
  • Receive Date: 30 May 2009
  • Revise Date: 22 December 2024
  • Accept Date: 30 May 2009