# Modular Irregular Labeling on Double-Star and Friendship Graphs
> Sugeng K.A.

URL kanonis: https://discover.unhas.ac.id/publications/pub_scopus_85122938722
Jurnal / Konferensi: Journal of Mathematics
Tahun terbit: 2021
DOI: https://doi.org/10.1155/2021/4746609
ISSN: 23144629
Kuartil SJR: Q3
Citations: 15

## Authors
- Sugeng K.A.

## Abstract
A modular irregular graph is a graph that admits a modular irregular labeling. 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 , … , k such that the weights of all vertices are different. The vertex weight is the sum of its incident edge labels, and all vertex weights are calculated with the sum modulo n . The modular irregularity strength is the minimum largest edge label such that a modular irregular labeling can be done. In this paper, we construct a modular irregular labeling of two classes of graphs that are biregular; in this case, the regular double-star graph and friendship graph classes are chosen. Since the modular irregularity strength of the friendship graph also holds the minimal irregularity strength, then the labeling is also an irregular labeling with the same strength as the modular case.

## Keywords
- Mathematics
- Combinatorics
- Vertex (graph theory)
- Graph
- Modulo
- Modular design
- Discrete mathematics
- Graph labeling
- Graph power
- Line graph
- Computer science
- Operating system

---
Sumber: Discover Unhas — RIMS Universitas Hasanuddin.
Saat mengutip, gunakan DOI bila tersedia atau URL kanonis di atas.