Abstract:We investigate the edge group irregularity strength (es g (G)) of graphs, i.e. the smallest value of s such that taking any Abelian group G of order s, there exists a function f : V (G) → G such that the sums of vertex labels at every edge are distinct. In this note we provide some upper bounds on es g (G) as well as for edge irregularity strength es(G) and harmonious order har(G).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.