Irregularity strength of regular graphs of large degree

DOI10.1016/0012-365X(93)90351-SMaRDI QIDQ685644zbMATH OpenFDO

Authors Juan-Miguel Gracia

Publication date 24 October 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(93)90351-S

zbMATH Keywords

irregularity strengthregular graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4142086
• Irregularity strength of regular graphs
• Irregularity strength of dense graphs
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
• A Tight Bound on the Irregularity Strength of Graphs

Cites work

• scientific article; zbMATH DE number 4142086 (Why is no real title available?)
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Irregularity strength of dense graphs
• Irregularity strength of regular graphs of large degree
• The irregularity strength of \(K_{m,m}\) is 4 for odd m

Cited in

(20)

• Distant irregularity strength of graphs
• On the irregularity strength of trees
• Irregularity strength of regular graphs of large degree
• The 1-2-3 conjecture holds for graphs with large enough minimum degree
• Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
• Modular irregularity strength of dense graphs
• Irregularity strength of dense graphs
• On asymptotic confirmation of the Faudree-Lehel conjecture on the irregularity strength of graphs (extended abstract)
• Equitable irregular edge-weighting of polar grid graph and Mongolian tent graph
• Irregular subgraphs
• The irregularity strength of \(K_{m,m}\) is 4 for odd m
• Irregularity strength of regular graphs
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
• Algorithm for computing the total vertex irregularity strength of some cubic graphs
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• A generalization of Faudree–Lehel conjecture holds almost surely for random graphs
• The characterization of large order (3, r)-regular graphs
• The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel
• Finding irregular subgraphs via local adjustments
• Total edge irregularity strength of large graphs

This page was built for publication: Irregularity strength of regular graphs of large degree

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