{"paper":{"title":"Note on group irregularity strength of disconnected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Antoni Marczyk, Marcin Anholcer, Rafal Jura, Sylwia Cichacz","submitted_at":"2017-07-13T19:03:57Z","abstract_excerpt":"We investigate the \\textit{group irregularity strength} ($s_g(G)$) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\\gr$ of order $s$, there exists a function $f:E(G)\\rightarrow \\gr$ such that the sums of edge labels at every vertex are distinct. So far it was not known if $s_g(G)$ is bounded for disconnected graphs. In the paper we we present some upper bound for all graphs. Moreover we give the exact values and bounds on $s_g(G)$ for disconnected graphs without a star as a component."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05148","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}