Kekuatan Ketakteraturan Sisi Modular Pada Graf Rantai C(nCm)
Open Access
- 30 June 2024
- journal article
- research article
- Published by Universitas Udayana in Jurnal Matematika
- Vol. 14 (1) , 108-116
Abstract
Modular edge irregular labeling of graph G is an vertex labeling f from V(G) to {1,2,3,…,k} which is induced a bijection w from E(G) to Zn , where w(xy) = f(x) + f(y). Modular edge irregularity strength of graph G, mes(G), is the minimum number k such that f is a modular edge irregular labeling on G. In this paper, we discuss the modular edge irregularity strength of chain graph C(nCm), for m = 4,6,and 8.Keywords
This publication has 6 references indexed in Scilit:
- Modular Version of Edge Irregularity Strength for Fan and Wheel GraphsSymmetry, 2022
- A Dynamic Survey of Graph LabelingThe Electronic Journal of Combinatorics, 2022
- Modular irregularity strength of graphsElectronic Journal of Graph Theory and Applications, 2020
- Computing the edge irregularity strengths of chain graphs and the join of two graphsElectronic Journal of Graph Theory and Applications, 2018
- Creating Ciphertext and Decipher using Graph Labeling TechniquesInternational Journal of Engineering and Advanced Technology, 2014
- On edge irregularity strength of graphsApplied Mathematics and Computation, 2014