An iterative approach to graph irregularity strength

DOI10.1016/j.dam.2010.02.003zbMath1213.05119OpenAlexW2075626857MaRDI QIDQ708356

Ronald J. Gould, Michael Ferrara, Michał Karoński, 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)

Related Items (6)

Note on group irregularity strength of disconnected graphs ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ 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 ⋮ Group irregularity strength of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irregularity strength of regular graphs
• The irregularity strength of \(tP_ 3\)
• Irregularity strength of trees
• On the irregularity strength of trees
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength

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