Abstract
his study aims to determine the total vertex irregularity strength on a series parallel graph for and . Total labeling is said to be vertex irregular, if the weights for each vertices are different. Determination of the total vertex irregularity of series parallel graph is done by obtaining the largest lower bound and the smallest upper bound. The lower bound is obtained by analyzing the structure of the graph to obtain the largest minimum label of k and the upper bound is analyzed by labeling the vertices and edges of the graph, where the largest label is k and the values for each vertices weight is different. The result obtained for the total vertex irregularity strength of a series parallel graph is .
Sign-in/Register to access full text options 
Free) 
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 call
