| dc.contributor.author | ARIFIN, Muhammad Syamsul Zainul | |
| dc.date.accessioned | 2024-08-08T02:38:50Z | |
| dc.date.available | 2024-08-08T02:38:50Z | |
| dc.date.issued | 2024-07-08 | |
| dc.identifier.nim | 201810101005 | en_US |
| dc.identifier.uri | https://repository.unej.ac.id/xmlui/handle/123456789/123057 | |
| dc.description | Finalisasi repositori tanggal 8 Agustus 2024_Kurnadi_Lana | en_US |
| dc.description.abstract | A modular irregular labeling of a graph G of order n is a mapping of the
set of edges of the graph to 1,2, … , 𝑘 such that different weights for all vertices. The
weight of each vertex is obtained from the sum of the incident edge labels with that
vertex in modulo 𝑛. The modular irregular strength is the minimum largest edge
label such that a modular irregular labeling can be done. The modular irregularity
strength value of 𝐺 is denoted by 𝑚𝑠(𝐺). In this research, we find strength of the
modular irregularity of the graph 𝐶3,𝑛 and graph graf 𝐶4,𝑛. The results show that
the graph 𝐶3,𝑛 and graph 𝐶4,𝑛 is a label for modular irregularity and at the same
time produces a value for the strength of modular irregularity. | en_US |
| dc.description.sponsorship | 1. Kusbudiono, S.Si., M.Si.
2. Dr. Kristiana Wijaya, S.Si., M.Si. | en_US |
| dc.language.iso | other | en_US |
| dc.publisher | Fakultas Matematika dan Ilmu Pengetahuan Alam | en_US |
| dc.subject | Regular Caterpillar Graph | en_US |
| dc.subject | Modular Irregularity Labeling | en_US |
| dc.subject | Modular Irregularity Strength | en_US |
| dc.title | Kekuatan Ketidakteraturan Modular pada Graf Caterpillar Teratur | en_US |
| dc.type | Skripsi | en_US |
| dc.identifier.prodi | Matematika | en_US |
| dc.identifier.pembimbing1 | Kusbudiono, S.Si., M.Si. | en_US |
| dc.identifier.pembimbing2 | Dr. Kristiana Wijaya, S.Si., M.Si. | en_US |
| dc.identifier.validator | validasi_repo_ratna_juli_2024 | en_US |
