How to make a random graph irregular

DOI10.1002/RSA.3240060219MaRDI QIDQ4697822zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza

Publication date 12 September 1995

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240060219

zbMATH Keywords

edge probabilityirregular edge labelingrandom graphtriangle packingsweight assignment

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Edge irregular total labellings for graphs of linear size
• On graph irregularity strength
• On the irregularity strength of dense graphs
• scientific article; zbMATH DE number 1409213

Cited in

(2)

• The irregularity strength and cost of the union of cliques
• A generalization of Faudree–Lehel conjecture holds almost surely for random graphs

This page was built for publication: How to make a random graph irregular

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