Abstract
In this research, we examine total vertex irregularity strength (tvs) of tadpole chain graph Tr(4,1) with length r. We obtain that tvs (Tr(4, 1))=⌈4r+2/5⌉. Further, we construct algorithm to determine label of vertices, label of edges, weight of vertices, and the exact value of tvs of Tr(4, 1).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.