English

Group irregularity strength of disconnected graphs

Combinatorics 2025-05-06 v1

Abstract

We investigate the \textit{group irregular strength} (sg(G))(s_g(G)) of graphs, i.e the smallest value of ss such that for any Abelian group Γ\Gamma of order ss exists a function g ⁣:E(G)Γg\colon E(G) \rightarrow \Gamma such that sums of edge labels at every vertex is distinct. We give results for bound and exact values of (sg(G))(s_g(G)) for graphs without small stars as components.

Keywords

Cite

@article{arxiv.2306.11914,
  title  = {Group irregularity strength of disconnected graphs},
  author = {Sylwia Cichacz and Barbara Krupińska},
  journal= {arXiv preprint arXiv:2306.11914},
  year   = {2025}
}

Comments

6 pages, 1 figure

R2 v1 2026-06-28T11:10:13.188Z