@article{Sesa_Muhlis_2023, title={Total Vertex Irregularity Strength Of Prismatic Graph Amalgamation}, volume={19}, url={https://journal.unhas.ac.id/index.php/jmsk/article/view/23571}, DOI={10.20956/j.v19i3.23571}, abstractNote={<p>It is not possible to determine the total vertex of irregular strength of all graphs. This study aims to ascertain the total vertex irregularity strength in prismatic graph amalgamation for n>=4. Determination of the total vertex irregularity strength in prismatic graph amalgamation is done by ascertaining the largest lower limit and the smallest upper limit. The lower limit is analyzed based on the graph properties and other supporting theorems, while the upper limit is analyzed by labeling the vertices and edges of the prismatic amalgamation graph. Based on the results of this study, the total vertex irregularity strength in prismatic graph amalgamation is obtained, namely (4(P<sub>2,n</sub>))=2n , for n>=4.</p>}, number={3}, journal={Jurnal Matematika, Statistika dan Komputasi}, author={Sesa, Junianto and Muhlis, La Ode}, year={2023}, month={May}, pages={433-446} }