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

irregular labelingirregularity strength

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

• A Tight Bound on the Irregularity Strength of Graphs
• 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?)
• 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

(17)

• Note on group irregularity strength of disconnected graphs
• 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
• On the hardness of determining the irregularity strength of graphs
• Group irregularity strength of connected graphs
• Computing an irregularity strength of selected graphs
• scientific article; zbMATH DE number 22657 (Why is no real title available?)
• Iterative algorithm for computing irregularity strength of complete graph.
• Computing edge irregularity strength of complete m-ary trees
• 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
• Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
• The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
• Finding irregular subgraphs via local adjustments
• The 1-2-3 conjecture holds for graphs with large enough minimum degree
• Total vertex product irregularity strength of graphs
• On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)

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)