Total irregular labeling of butterfly network on level two

-Previous results related to the concepts of the total irregular labeling of a graph indicate that the butterfly net work was one of some graphs which have not been specified in term of the total irregularit y strengths. This paper aimed to determine the total vertex rregularity strength, the total edge irregularity strength, and the total irregularity strength of butterfly net work on level 2. The assessment of three parameters of butterfly network was conducted by determining the lower bound and the upper bound. The lower bound was analyzed based on the characteristics of the graph and other proponent theorems, while upper bound was analyzed by constructing a function. In this paper we det ermine that the total vertex irregularit y strength, the total edge irregularity strength, and the total irregularity strength of butterfly net work are 4, 6, and 6, respectively