Some network topological notions of the Mycielskian of a graph

Efficiency and reliability are two important criteria in the designing of a good interconnection network. Network topological notions such as wide diameter, fault diameter, diameter vulnerability and (l,k)(l,k)-domination can be used to study the efficiency and reliability of a network. In this paper we study these notions in the Mycielskian of a graph and its iterates.