Group Irregular Labelings of Disconnected Graphs
Combinatorics
2017-12-01 v1
Abstract
We investigate the \textit{group irregularity strength} () of graphs, i.e. the smallest value of such that taking any Abelian group of order , there exists a function such that the sums of edge labels at every vertex are distinct. We give the exact values and bounds on for chosen families of disconnected graphs. In addition we present some results for the \textit{modular edge gracefulness} , i.e. the smallest value of such that there exists a function such that the sums of edge labels at every vertex are distinct.
Cite
@article{arxiv.1209.0200,
title = {Group Irregular Labelings of Disconnected Graphs},
author = {Marcin Anholcer and Sylwia Cichacz},
journal= {arXiv preprint arXiv:1209.0200},
year = {2017}
}