Further results on local inclusive distance vertex irregularity strength of graphs

Let G = ( V , E ) be a simple undirected graph. A labeling f : )→{1, …, k } is local inclusive d -distance vertex irregular of if every adjacent vertices x y ∈ have distinct weights, with the weight w ), sum labels whose distance from at most . The irregularity strength lidis least number for which there exists In this paper, we prove conjecture on 1 tree and generalize result block graph using clique number. Furthermore, present several results multipartite graphs also observe relationship chromatic