Note on the group edge irregularity strength of graphs

DOI10.1016/J.AMC.2019.01.007MaRDI QIDQ2009255zbMATH OpenOpenAlexWikidataFDO

Authors Marcin Anholcer, Sylwia Cichacz

Publication date 27 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1808.10018

zbMATH Keywords

abelian groupharmonious ordergroup edge irregularity strength

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

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

Recommendations

• Note on group irregularity strength of disconnected graphs
• Group irregularity strength of connected graphs
• ON EDGE IRREGULARITY STRENGTH OF SOME GRAPHS
• On edge irregularity strength of graphs
• On edge \(H\)-irregularity strengths of some graphs
• scientific article; zbMATH DE number 4139798
• On the total irregularity strength of some graphs
• Total edge irregularity strength of some families of graphs
• A note on the irregularity of graphs
• On vertex and edge \(H\)-irregularity strengths of graphs

Cites work

• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 3052436 (Why is no real title available?)
• A Tight Bound on the Irregularity Strength of Graphs
• A new upper bound for the irregularity strength of graphs
• An iterative approach to graph irregularity strength
• Edge weights and vertex colours
• Group irregularity strength of connected graphs
• Harmonious groups
• Harmonious order of graphs
• Irregular Assignments of Trees and Forests
• Irregularity strength of trees
• Neighbor sum distinguishing total chromatic number of planar graphs
• On Additive Bases and Harmonious Graphs
• On chromatic number of graphs and set-systems
• On edge irregularity strength of graphs
• On graph irregularity strength
• On irregular total labellings
• On the interval containing at least one prime number
• On the irregularity strength of dense graphs
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
• The difference between consecutive primes. II

Cited in

(4)

• Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs
• Note on group irregularity strength of disconnected graphs
• Group irregular labelings of disconnected graphs
• Group irregularity strength of connected graphs

This page was built for publication: Note on the group edge irregularity strength of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009255)