Please use this identifier to cite or link to this item: https://repository.unej.ac.id/xmlui/handle/123456789/112294
Title: On Distance Irregular Labeling of Disconnected Graphs
Authors: SUSANTO, Faisal
WIJAYA, Kristiana
PURNAMA, Prasanti Mia
SLAMIN, Slamin
Keywords: On Distance Irregular Labeling
of Disconnected Graphs
Issue Date: 13-Aug-2022
Publisher: Kragujevac Journal of Mathematics
Abstract: A distance irregular k-labeling of a graph G is a function f : V (G) → ¶1, 2, . . . , k♢ such that the weights of all vertices are distinct. The weight of a vertex v, denoted by wt(v), is the sum of labels of all vertices adjacent to v (distance 1 from v), that is, wt(v) = P u∈N(v) f(u). If the graph G admits a distance irregular labeling then G is called a distance irregular graph. The distance irregularity strength of G is the minimum k for which G has a distance irregular k-labeling and is denoted by dis(G). In this paper, we derive a new lower bound of distance irregularity strength for graphs with t pendant vertices. We also determine the distance irregularity strength of some families of disconnected graphs namely disjoint union of paths, suns, helms and friendships.
URI: https://repository.unej.ac.id/xmlui/handle/123456789/112294
Appears in Collections:LSP-Jurnal Ilmiah Dosen

Files in This Item:
File Description SizeFormat 
FMIPA_ON DISTANCE IRREGULAR LABELING OF DISCONNECTED.pdf574.18 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.