Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture

DOI10.37236/11413arXiv2109.13095OpenAlexW3201939494MaRDI QIDQ6117245

No author found.

Publication date: 16 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

bounds for regular graphsedge-weighting function

Mathematics Subject Classification ID

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

Cites Work

• Irregularity strength of regular graphs
• A New Upper Bound for the Irregularity Strength of Graphs
• Irregular Assignments of Trees and Forests
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• On the Irregularity Strength of Dense Graphs
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Irregularity strength of dense graphs
• On the asymptotic confirmation of the Faudree-Lehel conjecture for general graphs
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item