The use of Matlab to compute the total vertex irregularity strength of generalized uniform cactus chain graphs with pendant vertices
Isnaini Anniswati Rosyida · 2021
Given a graph G ( V , E ) which consists of the sets V (set of vertices) and E (set of edges), respectively. In this article, we study the “vertex irregular total k-labeling” of G and the “total vertex irregularity strength of G ” (tvs( G )). Based on the formulas that was initiated in the previous results, we construct algorithms to calculate the tvs of https://www.w3.org/1998/Math/MathML"> C r C n n − 2 https://s3-euw1-ap-pe-df-pch-content-public-p.s3.eu-west-1.amazonaws.com/9781003219248/a49098f7-942f-4173-9f24-c0311db45432/content/inline-math11_1.tif" xmlns:xlink=" https://www.w3.org/1999/xlink "/> , i.e., the generalized uniform cactus chain graphs which have ( n − 2) r vertices of degree one and the length of the chain is r . According to the formulas that have been published, the algorithms are constructed into two cases, i.e. the cycle on each chain is an odd cycle or an even cycle. Further, we evaluate the algorithm through Matlab programming. We choose Matlab to compute the tvs because it is better in constructing and programming mathematical formulas. Therefore, it could be an interactive media in the labeling process so that the students could learn the labeling concept easily.