Total edge irregularity strength of large graphs

DOI10.1016/J.DISC.2011.08.027zbMATH Open1238.05119arXiv1006.4501OpenAlexW2017093670MaRDI QIDQ658045FDOQ658045

Florian Pfender

Publication date: 11 January 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $m:=|E(G)|$ sufficiently large and $s:=(m-1)/3$. We show that unless the maximum degree $Delta>2s$, there is a weighting $w:EcupVo0,1,\mathrm{...},s$ so that $w(uv)+w(u)+w(v)ew(u^{\prime }{v}^{\prime })+w(u^{\prime })+w(v^{\prime })$ whenever $uve{u}^{\prime }{v}^{\prime }$ (such a weighting is called {em total edge irregular}). This validates a conjecture by Ivanco and Jendrol' for large graphs, extending a result by Brandt, Miskuf and Rautenbach.

Full work available at URL: https://arxiv.org/abs/1006.4501

Recommendations

• On edge irregularity strength of graphs
• Total edge irregularity strength of some families of graphs
• Total vertex irregularity strength of dense graphs
• On total vertex irregularity strength of graphs
• Irregularity strength of regular graphs of large degree
• Total vertex irregularity strength of some graphs
• scientific article
• Total edge irregularity strength for three classes of graphs
• On the total irregularity strength of some graphs
• On graph irregularity strength

zbMATH Keywords

total graph labeling

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Title not available (Why is that?)
• On irregular total labellings
• Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
• On a conjecture about edge irregular total labelings
• Total edge irregularity strength of trees
• Graph colouring and the probabilistic method
• Edge irregular total labellings for graphs of linear size

Cited In (9)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On a conjecture about edge irregular total labelings
• On total edge irregularity strength for some special types of uniform theta snake graphs
• Total irregularity strength of the generalized web graph \(W_0(t,3)\)
• Colourings of graphs by labellings
• Total edge irregularity strength of ladder-related graphs
• Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs
• Edge coloring by total labelings of outerplanar graphs

This page was built for publication: Total edge irregularity strength of large graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658045)