Share
Export Citation
APA
MLA
Chicago
Harvard
Vancouver
BIBTEX
RIS
Universitas Hasanuddin
Research output:Contribution to journal›Article›peer-review
On the Modular Irregularity Strength of Some Graph
Shulhany A.
Aip Conference Proceedings
Published: 2022Citations: 1
Abstract
Let G be a simple graph of order n, with no component of order two. Define an edge l-labeling θ:E(G)→{1,2,…,1}. Let xϵV(G), the weight of x is the sum of the l-labels of all its incident edges, denoted by α(x)=Σ░⟦θ(xy)⟧. The edge l-labeling is said modular irregular l-labeling of G if there exists a bijective weight α-function from V(G) to the group of integers modulo n. The smallest positive integer l such that G has a modular irregular l-labeling is said the modular irregularity strength of G, denoted by ms(G). Write ms(G)=∞, if G has no modular irregular strength. In this paper, we find ms of some graph classes, i.e. sunlet graphs, cycle barbell graphs, and m-Harary cycle graphs.
Access to Document
10.1063/5.0102490Other files and links
- Link to publication in Scopus
- Open Access Version Available
Fingerprint
CombinatoricsSciences
BijectionSciences
MathematicsSciences
GraphSciences
ModuloSciences
Simple graphSciences
Integer (computer science)Sciences
Modular designSciences
Modular formSciences
Discrete mathematicsSciences
Computer scienceSciences
Pure mathematicsSciences
Operating systemSciences
Programming languageSciences