English

Group Irregular Labelings of Disconnected Graphs

Combinatorics 2017-12-01 v1

Abstract

We investigate the \textit{group irregularity strength} (sg(G)s_g(G)) of graphs, i.e. the smallest value of ss such that taking any Abelian group \gr\gr of order ss, there exists a function f:E(G)\grf:E(G)\rightarrow \gr such that the sums of edge labels at every vertex are distinct. We give the exact values and bounds on sg(G)s_g(G) for chosen families of disconnected graphs. In addition we present some results for the \textit{modular edge gracefulness} k(G)k(G), i.e. the smallest value of ss such that there exists a function f:E(G)\zetsf:E(G)\rightarrow \zet_s such that the sums of edge labels at every vertex are distinct.

Keywords

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}
}
R2 v1 2026-06-21T21:58:38.403Z