A New Upper Bound for the Irregularity Strength of Graphs

From MaRDI portal
Publication:3225123

DOI10.1137/090774112zbMath1237.05183OpenAlexW2039110949MaRDI QIDQ3225123

Michał Karoński, Florian Pfender, Maciej Kalkowski

Publication date: 15 March 2012

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

Full work available at URL: https://doi.org/10.1137/090774112




Related Items (63)

Irregular subgraphsOn edge irregularity strength of graphsA note on the weak \((2,2)\)-conjectureProduct irregularity strength of graphs with small clique cover numberDistant set distinguishing total colourings of graphsOn vertex and edge H-irregularity strengths of graphsOn the edge irregularity strength for some classes of plane graphsNote on group irregularity strength of disconnected graphsIrregular labelings of helm and sun graphsAsymptotically optimal neighbour sum distinguishing colourings of graphsThe 1,2-conjecture for powers of cyclesA survey of irregularity strengthNeighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz RevisitedDistance irregularity strength of graphs with pendant verticesOn H-irregularity strength of graphsA note on breaking small automorphisms in graphsDistant irregularity strength of graphs with bounded minimum degreeThe neighbour sum distinguishing relaxed edge colouringOn the reflexive edge strength of the circulant graphsDistant irregularity strength of graphsDistant set distinguishing edge colourings of graphsA generalization of Faudree–Lehel conjecture holds almost surely for random graphsForcing \(k\)-repetitions in degree sequencesMinimum-weight edge discriminators in hypergraphsAsymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degreesNeighbour sum distinguishing edge-weightings with local constraintsModular irregularity strength on some flower graphsShort proof of the asymptotic confirmation of the Faudree-Lehel conjectureOn edge irregularity strength of different families of graphsA note on a directed version of the 1-2-3 conjectureA notion of vertex equitability for proper labellingsOn the neighbour sum distinguishing index of graphs with bounded maximum average degreeSum-distinguishing number of sparse hypergraphsDistant total irregularity strength of graphs via random vertex orderingDistant total sum distinguishing index of graphsUnnamed ItemOn irregularity strength of diamond networkA note on asymptotically optimal neighbour sum distinguishing colouringsThe 1-2-3 conjecture almost holds for regular graphsEdge irregularity strength of certain families of comb graphOn entire face irregularity strength of disjoint union of plane graphsOn the edge irregularity strength of corona product of cycle with isolated verticesOn -irregularity strength of ladders and fan graphsOn the edge irregularity strength of grid graphsOn weight choosabilities of graphs with bounded maximum average degreeTotal Vertex Irregularity Strength of Dense GraphsIrregular labelings of circulant graphsLinear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphsNote on the group edge irregularity strength of graphsDistant sum distinguishing index of graphsDecomposability of graphs into subgraphs fulfilling the 1-2-3 conjectureNeighbour sum distinguishing total colourings via the combinatorial nullstellensatzModular irregularity strength of graphsOn the total neighbour sum distinguishing index of graphs with bounded maximum average degreeOn edge \(H\)-irregularity strengths of some graphsDistant sum distinguishing index of graphs with bounded minimum degreeUpper bounds on inclusive distance vertex irregularity strengthOn the Neighbor Sum Distinguishing Index of Planar GraphsOn H-irregularity strengths of G-amalgamation of graphsOn the edge irregularity strength of corona product of graphs with cycleOn decomposing regular graphs into locally irregular subgraphsGroup irregularity strength of connected graphsOn face irregular evaluations of plane graphs




This page was built for publication: A New Upper Bound for the Irregularity Strength of Graphs