Irregularity strength of dense graphs

DOI10.1002/jgt.20313zbMath1188.05112OpenAlexW4233288679MaRDI QIDQ5902039

Felix Lazebnik, Bill Cuckler

Publication date: 4 June 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20313

zbMATH Keywords

irregular assignmentirregularity strengthspanning forest

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

A note on adjacent vertex distinguishing colorings of graphs, Irregular subgraphs, A note on the weak \((2,2)\)-conjecture, Distant irregularity strength of graphs with bounded minimum degree, Distant irregularity strength of graphs, A generalization of Faudree–Lehel conjecture holds almost surely for random graphs, Colourings of graphs by labellings, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, Short proof of the asymptotic confirmation of the Faudree-Lehel conjecture, On the neighbour sum distinguishing index of graphs with bounded maximum average degree, Distant total irregularity strength of graphs via random vertex ordering, Distant total sum distinguishing index of graphs, A note on asymptotically optimal neighbour sum distinguishing colourings, The 1-2-3 conjecture almost holds for regular graphs, Total Vertex Irregularity Strength of Dense Graphs, Distant sum distinguishing index of graphs, Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, On the total neighbour sum distinguishing index of graphs with bounded maximum average degree, Distant sum distinguishing index of graphs with bounded minimum degree, On the Neighbor Sum Distinguishing Index of Planar Graphs

Cites Work

• Irregularity strength of regular graphs of large degree
• On the number of irregular assignments on a graph
• Irregularity strength of trees
• The irregularity strength and cost of the union of cliques
• Irregularity strength and compound graphs
• The irregularity strength of circulant graphs
• On the irregularity strength of them ×n grid
• On the irregularity strength of trees
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item