Abstract
Let G = ( V , E ) be a simple undirected graph. A labeling f : V ( G )→{1, …, k } is a local inclusive d -distance vertex irregular labeling of G if every adjacent vertices x , y ∈ V ( G ) have distinct weights, with the weight w ( x ), x ∈ V ( G ) is the sum of every labels of vertices whose distance from x is at most d . The local inclusive d -distance vertex irregularity strength of G , lidis ( G ) , is the least number k for which there exists a local inclusive d -distance vertex irregular labeling of G . In this paper, we prove a conjecture on the local inclusive d -distance vertex irregularity strength for d = 1 for tree and we generalize the result for block graph using the clique number. Furthermore, we present several results for multipartite graphs and we also observe the relationship with chromatic number.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.