Note on the group edge irregularity strength of graphs

2018/08/29 by Marcin Anholcer, Anholcer, Marcin, Sylwia Cichacz +1
Computer Science · Engineering · Mathematics · #Graph Labeling and Dimension Problems #graph theory and CDMA systems #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1808.10018

Abstract

We investigate the edge group irregularity strength (es_g(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 upper bounds on es_g(G) as well as for edge irregularity strength es(G) and harmonious order \rmhar(G).

Citations

• The Difference Between Consecutive Primes

Related

• Total Edge Irregularity Strength for Graphs
• A note on edge irregularity strength of Dandelion graph
• Total vertex product irregularity strength of graphs
• A unified approach to total irregular labeling
• The irregularity strength of dense graphs -- on asymptotically optimal solutions of problems of Faudree, Jacobson, Kinch and Lehel