An iterative approach to graph irregularity strength

DOI10.1016/J.DAM.2010.02.003MaRDI QIDQ708356zbMATH OpenOpenAlexFDO

Authors Michael Ferrara, Ronald Gould, Michal Karonski, Florian Pfender

Publication date 11 October 2010

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

Full work available at URL https://doi.org/10.1016/j.dam.2010.02.003

zbMATH Keywords

irregularity strengthirregular labeling

Mathematics Subject Classification ID

Signed and weighted graphs (05C22)

Recommendations

• On graph irregularity strength
• The irregularity strength of \(tK_ p\)
• A Tight Bound on the Irregularity Strength of Graphs
• Irregularity strength of dense graphs
• Irregular Assignments of Trees and Forests

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 139927 (Why is no real title available?)
• scientific article; zbMATH DE number 867641 (Why is no real title available?)
• A Tight Bound on the Irregularity Strength of Graphs
• Irregularity strength of regular graphs
• Irregularity strength of trees
• On graph irregularity strength
• On the irregularity strength of trees
• The irregularity strength of \(tP_ 3\)

Cited in

(10)

• Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
• Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
• Note on the group edge irregularity strength of graphs
• Note on group irregularity strength of disconnected graphs
• Iterative algorithm for computing irregularity strength of complete graph.
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
• Computing edge irregularity strength of complete $m$-ary trees
• Group irregularity strength of connected graphs
• A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
• Computing an irregularity strength of selected graphs

This page was built for publication: An iterative approach to graph irregularity strength

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