Metraipolis › archive › dc_bd030841aa12
Total Vertex Irregularity Strength of Cubic and 4-Regular Graphs — arXiv:2609.30114
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.30114
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:41:04.265Z
- SHA-256 of the archived text
10b8eb74f187a56912dbcdf5e8a8344e23a9ba71cdd857e2d3f248ce97b462e2- Stable URL of this page
https://metraipolis.com/documento/dc_bd030841aa12
How to cite
Total Vertex Irregularity Strength of Cubic and 4-Regular Graphs — arXiv:2609.30114 — arXiv (en), https://arxiv.org/abs/2609.30114 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd030841aa12 (Metraipolis archive dc_bd030841aa12, sha256 10b8eb74f187a56912dbcdf5e8a8344e23a9ba71cdd857e2d3f248ce97b462e2)
BibTeX
@misc{dcbd030841aa12,
title = {Total Vertex Irregularity Strength of Cubic and 4-Regular Graphs — arXiv:2609.30114},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.30114},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd030841aa12; sha256 10b8eb74f187a56912dbcdf5e8a8344e23a9ba71cdd857e2d3f248ce97b462e2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.30114. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a graph and $k$ be a positive integer. A total $k$-labeling of $G$ assigns to each vertex and each edge a label from $\{1,\ldots,k\}$. The weight of a vertex is the sum of its label and the labels of its incident edges. A total labeling is vertex irregular if all vertex weights are distinct. The total vertex irregularity strength $\text{tvs}(G)$ is the smallest $k$ for which $G$ has a vertex irregular total $k$-labeling. For an $r$-regular graph $G$ on $n$ vertices, a counting argument gives $\text{tvs}(G)\ge\lceil(n+r)/(r+1)\rceil$. The restriction of a conjecture of Nurdin, Baskoro, Salman, and Gaos to regular graphs asserts that this bound is attained. We prove this assertion for cubic and $4$-regular graphs. We also show that, for every fixed $r\ge2$, a recent theorem on prescribed degree frequencies implies the assertion for all sufficiently large $r$-regular graphs.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.30114 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T06:02:10.091Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).