Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs

Marcin Anholcer, Sylwia Cichacz and Jakub Przybyło

Applied Mathematics and Computation, 2019, vol. 343, issue C, 149-155

Abstract: We investigate the group irregularity strength, sg(G), of a graph, i.e., the least integer k such that taking any Abelian group G of order k, there exists a function f:E(G)→G so that the sums of edge labels incident with every vertex are distinct. So far the best upper bound on sg(G) for a general graph G was exponential in n−c, where n is the order of G and c denotes the number of its components. In this note we prove that sg(G) is linear in n, namely not greater than 2n. In fact, we prove a stronger result, as we additionally forbid the identity element of a group to be an edge label or the sum of labels around a vertex. We consider also locally irregular labelings where we require only sums of adjacent vertices to be distinct. For the corresponding graph invariant we prove the general upper bound: Δ(G)+col(G)−1 (where col(G) is the coloring number of G) in the case when we do not use the identity element as an edge label, and a slightly worse one if we additionally forbid it as the sum of labels around a vertex. In the both cases we also provide a sharp upper bound for trees and a constant upper bound for the family of planar graphs.

Keywords: Irregularity strength; Sum chromatic number; Coloring number; Arboricity; Abelian group (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031830835X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:343:y:2019:i:c:p:149-155

DOI: 10.1016/j.amc.2018.09.056

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().