A unified approach to total vertex irregularity strength

	A unified approach to total vertex irregularity strength
Transactions on Combinatorics
مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 16 شهریور 1405
نوع مقاله: Research Paper
شناسه دیجیتال (DOI): 10.22108/toc.2026.145174.2276
نویسنده
Aleams Barra^*
Algebra Research Group, Institut Teknologi Bandung
چکیده
We develop a unified framework for computing the total vertex irregularity strength (tvs) of diverse graph classes, significantly extending our prior work in Barra et al. This comprehensive approach generalizes and enhances earlier methods, offering a robust technique applicable to a wide range of graph structures. A notable achievement is resolving an open problem by determining the tvs for simple 2-regular graphs, confirming the conjecture by Ahmad et al. Furthermore, our framework provides unified proofs for the tvs of cycles, paths, prisms, wheels, helm graphs, and friendship graphs. Importantly, the versatility of this method suggests its potential utility in computing tvs for additional graph classes, broadening its impact in graph theory and computational applications.
کلیدواژه‌ها
total vertex irregularity strength؛ graph labeling؛ irregular labeling

آمار تعداد مشاهده مقاله: 3

سامانه مدیریت نشریات علمی. طراحی و پیاده سازی از سیناوب