Two types irregular labelling on dodecahedral modified generalization graph
Irregular labelling on graph is a function from component of graph to non-negative natural number such that the weight of all vertices, or edges are distinct. The component of graph is a set of vertices, a set of edges, or a set of both. In this paper we study two types of irregular labelling on dod...
Main Authors: | Nurdin Hinding, Kiki A. Sugeng, Nurlindah, Timothy J. Wahyudi, Rinovia Simanjuntak |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2022-11-01
|
Series: | Heliyon |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2405844022024859 |
Similar Items
-
Modular total vertex irregularity strength of graphs
by: Gohar Ali, et al.
Published: (2023-01-01) -
The Irregularity and Modular Irregularity Strength of Fan Graphs
by: Martin Bača, et al.
Published: (2021-04-01) -
Counterexamples to the total vertex irregularity strength’s conjectures
by: Faisal Susanto, et al.
Published: (2023-11-01) -
Total vertex irregularity strength of trees with maximum degree five
by: S. Susilawati, et al.
Published: (2018-10-01) -
Computing The Irregularity Strength of Planar Graphs
by: Hong Yang, et al.
Published: (2018-08-01)