Show simple item record

dc.contributor.authorSUSANTO, Faisal
dc.contributor.authorWIJAYA, Kristiana
dc.contributor.authorSUDARSANA, I Wayan
dc.contributor.authorSLAMIN, Slamin
dc.date.accessioned2023-02-22T02:34:04Z
dc.date.available2023-02-22T02:34:04Z
dc.date.issued2022-04-04
dc.identifier.urihttps://repository.unej.ac.id/xmlui/handle/123456789/112302
dc.description.abstractA 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 investigateden_US
dc.language.isoenen_US
dc.publisherElectronic Journal of Graph Theory and Applications (EJGTA)en_US
dc.subjectvertex k-labelingen_US
dc.subjectnon-inclusive distance irregularity strengthen_US
dc.subjectinclusive distance irregularity strengthen_US
dc.subjectjoin product Mathematics Subject Classificationen_US
dc.titleNon-inclusive and inclusive distance irregularity strength for the join product of graphsen_US
dc.typeArticleen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record