Note on the group edge irregularity strength of graphs

DOI10.1016/j.amc.2019.01.007zbMath1428.05260arXiv1808.10018OpenAlexW2889226214WikidataQ128521595 ScholiaQ128521595MaRDI QIDQ2009255

Sylwia Cichacz, Marcin Anholcer

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

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

Cites Work

• Unnamed Item
• Unnamed Item
• On edge irregularity strength of graphs
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• An iterative approach to graph irregularity strength
• On irregular total labellings
• Harmonious order of graphs
• Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.
• Irregularity strength of trees
• Edge weights and vertex colours
• Neighbor sum distinguishing total chromatic number of planar graphs
• Group irregularity strength of connected graphs
• Harmonious groups
• The Difference Between Consecutive Primes, II
• A New Upper Bound for the Irregularity Strength of Graphs
• On Additive Bases and Harmonious Graphs
• Irregular Assignments of Trees and Forests
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• On the Irregularity Strength of Dense Graphs
• On chromatic number of graphs and set-systems
• On the interval containing at least one prime number

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