Abstract
Previous results related to the concepts of the total irregular labeling of a graph indicate that the butterfly network was one of some graphs which have not been specified in term of the total irregularity strengths. This paper aimed to determine the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of butterfly network 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 determine that the total vertex irregularity strength, the total edge irregularity strength, and the total irregularity strength of butterfly network are 4, 6, and 6, respectively.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
