An iterative approach to graph irregularity strength

DOI10.1016/J.DAM.2010.02.003zbMATH Open1213.05119OpenAlexW2075626857MaRDI QIDQ708356FDOQ708356

Ronald Gould, Michael Ferrara, 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)

Cites Work

• On graph irregularity strength
• On the irregularity strength of trees
• A Tight Bound on the Irregularity Strength of Graphs
• Irregularity strength of regular graphs
• Irregularity strength of trees
• The irregularity strength of \(tP_ 3\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

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