Note on the group edge irregularity strength of graphs

DOI10.1016/J.AMC.2019.01.007zbMATH Open1428.05260arXiv1808.10018OpenAlexW2889226214WikidataQ128521595 ScholiaQ128521595MaRDI QIDQ2009255FDOQ2009255

Authors: Marcin Anholcer, Sylwia Cichacz 

Publication date: 27 November 2019

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

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

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

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

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)

Cites Work

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

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)