Note on the group edge irregularity strength of graphs

Marcin Anholcer and Sylwia Cichacz

Applied Mathematics and Computation, 2019, vol. 350, issue C, 237-241

Abstract: We investigate the group edge irregularity strength (esg(G)) of graphs, i.e. the smallest value of s such that taking any Abelian group G of order s, there exists a function f:V(G)→G such that the sums of vertex labels at every edge are distinct. In this note we provide some the upper bounds on esg(G) as well as for edge irregularity strength es(G) and harmonious order har(G).

Keywords: Group edge irregularity strenght; Harmonious order; 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/S0096300319300153
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:350:y:2019:i:c:p:237-241

DOI: 10.1016/j.amc.2019.01.007

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 ().