On vertex and edge H-irregularity strengths of graphs
Faraha Ashraf, Martin Bača, Zuzana Kimáková, Andrea Semaničová–Feňovčíková · Discrete Mathematics Algorithms and Applications · 2016
We introduce two new graph characteristics, the edge [Formula: see text]-irregularity strength and the vertex [Formula: see text]-irregularity strength of a graph. We estimate the bounds of these parameters and determine their exact values for several families of graphs namely, paths, ladders and fans.