A unified approach to total irregular labeling
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913906673319936 |
|---|---|
| author | Barra, Aleams |
| author_facet | Barra, Aleams |
| contents | 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 $K_{n,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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_17922 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A unified approach to total irregular labeling Barra, Aleams Combinatorics 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 $K_{n,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. |
| title | A unified approach to total irregular labeling |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2506.17922 |