A unified approach to total irregular labeling
Abstract
We present a unified approach to compute the total vertex irregularity strength (tvs) of various graphs, employing a novel technique recently proposed by Barra et al. For graphs such as cycles, paths, prisms, wheels, complete graphs, helm graphs, friendship graphs, and Kn,n , we offer simplified and unified proofs of their previously established tvs values. Furthermore, we resolve an open problem by determining the tvs for simple 2-regular graphs.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.