Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Riemann : Research of Mathematics and Mathematics Education

Total Edge Irregularity Strength of Graph L_3⊙N_m Nikita; Sri Nurhayati; Trisha Magdalena A. Jauvani; Selvy Musdalifah; Iman Al Fajri; Andri
Riemann: Research of Mathematics and Mathematics Education Vol. 7 No. 2 (2025): EDISI AGUSTUS
Publisher : Program Studi Pendidikan Matematika Universitas Katolik Santo Agustinus Hippo

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.38114/reimann.v7i2.104

Abstract

An edge irregular total k-labeling of a simple graph  is a labeling that assigns positive integers to its vertices and edges such that the weight of every edge, defined as the sum of the labels of the edge and its two incident vertices, is distinct. The smallest integer  that allows such a labeling is called the total edge irregularity strength, denoted by  In this paper, we study the total edge irregularity strength of the corona product of a ladder graph ​ and a null graph ​, denoted by  By applying constructive labeling and analyzing the resulting edge weights, we show that all edges can be assigned distinct weights. From Theorem 1, it is obtained that . This result contributes to the development of graph labeling theory and can be extended to larger ladder graphs for further applications, including cryptography and network security.