Two types irregular labelling on dodecahedral modified generalization graph.

Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we study two types of irregular labelling on dodecahedral modified generalization graph.