{"arxiv_id":"2611.16338","title":"Total edge irregularity strength of cubic graphs","abstract":"We show that every finite simple cubic graph on $n$ vertices has total edge irregularity strength $n/2+1$, confirming the Ivan\\v{c}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.","primary_cat":"math.CO","cross_cats":[],"submitted_at":"2026-11-12T05:59:08+00:00","latest_version":1,"source":"arxiv","source_label":"arXiv","source_url":null,"has_pdf":true,"has_source":false,"verdict":"ACCEPT","confidence":"HIGH","one_line_summary":"Every finite simple cubic graph on n vertices has total edge irregularity strength n/2+1, confirming the Ivančo-Jendrol' conjecture for the entire class of cubic graphs.","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","upvotes":0,"downvotes":0,"pith_score":0,"inbound_count":0,"_links":{"html":"https://pith.science/paper/2611.16338","verdict":"/api/v1/verdicts/2611.16338"}}