Group Irregular Labelings of Disconnected Graphs
Marcin Anholcer, Sylwia Cichacz

TL;DR
This paper studies the group irregularity strength and modular edge gracefulness of disconnected graphs, providing exact values and bounds for these graph labeling parameters.
Contribution
It introduces new bounds and exact values for the group irregularity strength and modular edge gracefulness of specific families of disconnected graphs.
Findings
Exact values and bounds for $s_g(G)$ for certain disconnected graphs.
Results on the modular edge gracefulness $k(G)$ for disconnected graphs.
New theoretical insights into graph labelings with Abelian groups.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems
