dc.contributor.author | SUSANTO, Faisal | |
dc.contributor.author | WIJAYA, Kristiana | |
dc.contributor.author | SUDARSANA, I Wayan | |
dc.contributor.author | SLAMIN, Slamin | |
dc.date.accessioned | 2023-02-22T02:34:04Z | |
dc.date.available | 2023-02-22T02:34:04Z | |
dc.date.issued | 2022-04-04 | |
dc.identifier.uri | https://repository.unej.ac.id/xmlui/handle/123456789/112302 | |
dc.description.abstract | A function φ : V (G) → {1, 2, . . . , k} of a simple graph G is said to be a non-inclusive distance
vertex irregular k-labeling of G if the sums of labels of vertices in the open neighborhood of every
vertex are distinct and is said to be an inclusive distance vertex irregular k-labeling of G if the
sums of labels of vertices in the closed neighborhood of each vertex are different. The minimum
k for which G has a non-inclusive (resp. an inclusive) distance vertex irregular k-labeling is called
a non-inclusive (resp. an inclusive) distance irregularity strength and is denoted by dis(G) (resp.
by dis( c G)). In this paper, the non-inclusive and inclusive distance irregularity strength for the join
product graphs are investigated | en_US |
dc.language.iso | en | en_US |
dc.publisher | Electronic Journal of Graph Theory and Applications (EJGTA) | en_US |
dc.subject | vertex k-labeling | en_US |
dc.subject | non-inclusive distance irregularity strength | en_US |
dc.subject | inclusive distance irregularity strength | en_US |
dc.subject | join product Mathematics Subject Classification | en_US |
dc.title | Non-inclusive and inclusive distance irregularity strength for the join product of graphs | en_US |
dc.type | Article | en_US |