The irregularity strength and cost of the union of cliques

DOI10.1016/0012-365X(95)00186-ZzbMath0852.05054MaRDI QIDQ1916108

Zsolt Tuza, Michal Tkáč, Stanlislav Jendroľ

Publication date: 2 July 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

networkirregularity strengthirregularity cost

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Total edge irregularity strength of generalized prism ⋮ A smallest irregular oriented graph containing a given diregular one ⋮ On the total irregularity strength of convex polytope graphs ⋮ On irregular total labellings ⋮ Total edge irregularity strength of accordion graphs ⋮ 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 ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ Irregularity strength of dense graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The irregularity strength of \(tP_ 3\)
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• The irregularity strength of \(tK_ p\)
• How to make a random graph irregular
• Irregularity strength of dense graphs

This page was built for publication: The irregularity strength and cost of the union of cliques