Answers are grounded in this paper and cite their sources.
We show that every finite simple cubic graph on n vertices has total edge irregularity strength $n/2+1$, confirming the Ivančo-Jendrol' conjecture for cubic graphs. The key step is to algorithmically construct a \1,n/2+1\-vertex labeling such that half of the vertices are labeled $1$ and the average degree of the subgraph induced by them is close enough to two. We extend such a labeling to a total edge irregular $(n/2+1)$-labeling, possibly after a local adjustment to a single vertex.
No takes yet. Share an insight, caveat, or question.
Barra et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: