Irregularity strength of dense graphs

DOI10.1016/0012-365X(91)90161-TzbMath0755.05092MaRDI QIDQ5905417

Jenő Lehel, Michael S. Jacobson, Ralph J. Faudree, Lael F. Kinch

Publication date: 26 June 1992

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

zbMATH Keywords

complete graphsirregular assignmentirregularity strengthdense graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items

The irregularity strength of \(tK_ p\), The irregularity strength and cost of the union of cliques, On the number of irregular assignments on a graph, Irregularity strength of regular graphs of large degree, Unnamed Item, Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs

Cites Work

• Conditions for sequences to be r-graphic
• The irregularity strength of \(K_{m,m}\) is 4 for odd m
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item