Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
From MaRDI portal
Publication:5189534
DOI10.1137/070707385zbMath1216.05135OpenAlexW2094180602MaRDI QIDQ5189534
Publication date: 17 March 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070707385
Related Items (55)
A note on adjacent vertex distinguishing colorings of graphs ⋮ Computing the Total Vertex Irregularity Strength Associated with Zero Divisor Graph of Commutative Ring ⋮ On edge irregularity strength of graphs ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ Total vertex irregularity strength of generalized prism 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 ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited ⋮ Distance irregularity strength of graphs with pendant vertices ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ Distant irregularity strength of graphs with bounded minimum degree ⋮ Distant irregularity strength of graphs ⋮ Neighbor sum distinguishing index of planar 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 ⋮ On edge irregularity strength of different families of graphs ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ On irregularity strength of diamond network ⋮ A note on asymptotically optimal neighbour sum distinguishing colourings ⋮ Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ On The Total Edge and Vertex Irregularity Strength of Some Graphs Obtained from Star ⋮ Edge irregularity strength of certain families of comb graph ⋮ On entire face irregularity strength of disjoint union of plane graphs ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ 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 ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Total Vertex Irregularity Strength of Dense Graphs ⋮ Irregular labelings of circulant graphs ⋮ Distant sum distinguishing index of graphs ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ On total \(H\)-irregularity strength of the disjoint union of graphs ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ Total irregularity strength of three families of graphs ⋮ Unnamed Item ⋮ Distant sum distinguishing index of graphs with bounded minimum degree ⋮ On the Neighbor Sum Distinguishing Index of Planar Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new upper bound for the total vertex irregularity strength of graphs ⋮ On H-irregularity strengths of G-amalgamation of graphs ⋮ On the edge irregularity strength of corona product of graphs with cycle ⋮ Neighbor sum distinguishing total colorings of triangle free planar graphs ⋮ On face irregular evaluations of plane graphs
This page was built for publication: Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
