Note on group irregularity strength of disconnected graphs
Abstract
We investigate the group irregularity strength (sg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group of order s, there exists a function f:E(G)→ such that the sums of edge labels at every vertex are distinct. So far it was not known if sg(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 sg(G) for disconnected graphs without a star as a component.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.