Two types irregular labelling on dodecahedral modified generalization graph

Abstract

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. We determined the total vertex irregularity strength and the modular irregularity strength of dodecahedral modified generalized graph. These results are important because there many classes of graph have the same structure with modified dodecahedral graphs. These results can be used to determine the total vertex irregularity strength and the modular irregularity strength of other graphs that have the similar structure with modified dodecahedral graph.

Access to Document

Other files and links

• Link to publication in Scopus
• Open Access Version Available

Fingerprint