Total Vertex Irregularity Strength Of Prismatic Graph Amalgamation

Authors

  • Junianto Sesa Universitas Papua
  • La Ode Muhlis

DOI:

https://doi.org/10.20956/j.v19i3.23571

Keywords:

Amalgamasi, Graf Prisma, Nilai Total Ketidakteraturan Titik

Abstract

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(P2,n))=2n , for n>=4.

Downloads

Published

2023-05-05

How to Cite

Sesa, J., & Muhlis, L. O. . (2023). Total Vertex Irregularity Strength Of Prismatic Graph Amalgamation. Jurnal Matematika, Statistika Dan Komputasi, 19(3), 433–446. https://doi.org/10.20956/j.v19i3.23571

Issue

Vol. 19 No. 3 (2023): MAY, 2023

Section

Research Articles

License

Copyright (c) 2023 Author and publisher

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Jurnal Matematika, Statistika dan Komputasi is an Open Access journal, all articles are distributed under the terms of the Creative Commons Attribution License, allowing third parties to copy and redistribute the material in any medium or format, transform, and build upon the material, provided the original work is properly cited and states its license.  This license allows authors and readers to use all articles, data sets, graphics and appendices in data mining applications, search engines, web sites, blogs and other platforms by providing appropriate reference.