Abstract
Abstract A totally irregular total k-labeling λ: V ∪ E → {1, 2, · · ·, k} of a graph G is a total labeling such that G has a total edge irregular labeling and a total vertex irregular labeling at the same time. The minimum k for which a graph G has a totally irregular total k-labeling is called the total irregularity strength of G, denoted by ts(G). In this paper, we investigate some graphs whose total irregularity strength equals to the lower bound.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
