A Tight Bound on the Irregularity Strength of Graphs
From MaRDI portal
Publication:4490788
DOI10.1137/S0895480196314291zbMath0947.05067MaRDI QIDQ4490788
Publication date: 20 July 2000
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (69)
Computing the Total Vertex Irregularity Strength Associated with Zero Divisor Graph of Commutative Ring ⋮ Total edge irregularity strength of generalized prism ⋮ Total vertex irregularity strength of generalized prism graphs ⋮ A note on the weak \((2,2)\)-conjecture ⋮ Distant set distinguishing total colourings of graphs ⋮ Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs ⋮ On reflexive edge strength of generalized prism graphs ⋮ On vertex and edge H-irregularity strengths of graphs ⋮ Asymptotically optimal neighbour sum distinguishing colourings of graphs ⋮ A survey of irregularity strength ⋮ On the total irregularity strength of convex polytope graphs ⋮ On edge irregular reflexive labellings for the generalized friendship graphs ⋮ Going wide with the 1-2-3 conjecture ⋮ On irregular total labellings ⋮ On H-irregularity strength of graphs ⋮ Total edge irregularity strength of accordion graphs ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Edge irregular reflexive labeling for the \(r\)-th power of the path ⋮ Distant irregularity strength of graphs ⋮ Distant set distinguishing edge colourings of graphs ⋮ A generalization of Faudree–Lehel conjecture holds almost surely for random graphs ⋮ Colourings of graphs by labellings ⋮ Minimum-weight edge discriminators in hypergraphs ⋮ 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 ⋮ A notion of vertex equitability for proper labellings ⋮ On the neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ Sum-distinguishing number of sparse hypergraphs ⋮ 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 ⋮ Edge coloring total \(k\)-labeling of generalized Petersen graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ On the edge irregular reflexive labeling of corona product of graphs with path ⋮ Edge colouring by total labellings ⋮ Total edge irregularity strength of complete graphs and complete bipartite graphs ⋮ On the complexity of determining the irregular chromatic index of a graph ⋮ Irregularity strength of dense graphs ⋮ Total Vertex Irregularity Strength of Dense Graphs ⋮ Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs ⋮ Note on the group edge irregularity strength of graphs ⋮ Distant sum distinguishing index of graphs ⋮ An iterative approach to graph irregularity strength ⋮ On the total vertex irregularity strength of trees ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Modular irregularity strength of graphs ⋮ Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs ⋮ Total irregularity strength of three families of graphs ⋮ On the total neighbour sum distinguishing index of graphs with bounded maximum average degree ⋮ On edge \(H\)-irregularity strengths of some graphs ⋮ Unnamed Item ⋮ Note on edge irregular reflexive labelings of graphs ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ Upper bounds on inclusive distance vertex irregularity strength ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Edge irregular total labellings for graphs of linear size ⋮ A new upper bound for the total vertex irregularity strength of graphs ⋮ Product irregularity strength of graphs ⋮ On the hardness of determining the irregularity strength of graphs ⋮ Edge irregular reflexive labeling for disjoint union of generalized Petersen graph ⋮ The irregularity strength of circulant graphs ⋮ Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite Graphs ⋮ On decomposing regular graphs into locally irregular subgraphs ⋮ On partitioning the orbitals of a transitive permutation group
This page was built for publication: A Tight Bound on the Irregularity Strength of Graphs
