Abstract
For a simple graph G = ( V,E ) , a mapping φ : V ∪ E → { 1 , 2 ,..., k } is defined as a vertex irregular total k -labeling of G if for every two different vertices x and y , wt ( x ) ≠ wt ( y ), where wt ( x ) = φ ( x )+ Σ xy ∈ E ( G ) φ ( xy ). The minimum k for which the graph G has a vertex irregular total k -labeling is called the total vertex irregularity strength of G . In this paper, we provide three possible values of total vertex irregularity strength for trees with many vertices of degree two. For each of the possible values, sufficient conditions for trees with corresponding total vertex irregularity strength are presented.
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.