On the irregularity strength of trees

DOI10.1002/jgt.10158zbMath1034.05015OpenAlexW4232581931MaRDI QIDQ4459603

David W. Kravitz, Tom Bohman

Publication date: 29 March 2004

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

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

zbMATH Keywords

treesirregularity strength

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (44)

Computing the Total Vertex Irregularity Strength Associated with Zero Divisor Graph of Commutative Ring ⋮ Total edge irregularity strength of generalized prism ⋮ On edge irregularity strength of graphs ⋮ Total vertex irregularity strength of generalized prism graphs ⋮ Product irregularity strength of graphs with small clique cover number ⋮ On vertex and edge H-irregularity strengths of graphs ⋮ On the edge irregularity strength for some classes of plane graphs ⋮ Irregular labelings of helm and sun graphs ⋮ A survey of irregularity strength ⋮ On the total irregularity strength of convex polytope graphs ⋮ On H-irregularity strength of graphs ⋮ Total edge irregularity strength of accordion graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ On the reflexive edge strength of the circulant 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 ⋮ Modular irregularity strength on some flower graphs ⋮ On edge irregularity strength of different families of graphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Distant total sum distinguishing index of graphs ⋮ On edge irregular total labeling of categorical product of two cycles ⋮ Unnamed Item ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Edge irregularity strength of certain families of comb graph ⋮ On the edge irregularity strength of corona product of cycle with isolated vertices ⋮ Vertex irregular reflexive labeling of prisms and wheels ⋮ On the edge irregularity strength of grid graphs ⋮ Irregular total labellings of generalized Petersen graphs ⋮ Irregularity strength of dense graphs ⋮ Distant sum distinguishing index of graphs ⋮ An iterative approach to graph irregularity strength ⋮ On the total vertex irregularity strength of trees ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Modular irregularity strength of graphs ⋮ Total irregularity strength of three families of graphs ⋮ On edge \(H\)-irregularity strengths of some graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Unnamed Item ⋮ Edge irregular total labellings for graphs of linear size ⋮ Irregularity strength of digraphs ⋮ Computing the edge irregularity strengths of chain graphs and the join of two graphs ⋮ Total vertex irregularity strength of trees with maximum degree five ⋮ On the edge irregularity strength of corona product of graphs with cycle

This page was built for publication: On the irregularity strength of trees