Group twin coloring of graphs
Abstract
For a given graph G, the least integer k≥ 2 such that for every Abelian group G of order k there exists a proper edge labeling f:E(G)→ G so that Σx∈ N(u)f(xu)≠ Σx∈ N(v)f(xv) for each edge uv∈ E(G) is called the group twin chromatic index of G and denoted by 'g(G). This graph invariant is related to a few well-known problems in the field of neighbor distinguishing graph colorings. We conjecture that 'g(G)≤ (G)+3 for all graphs without isolated edges, where (G) is the maximum degree of G, and provide an infinite family of connected graph (trees) for which the equality holds. We prove that this conjecture is valid for all trees, and then apply this result as the base case for proving a general upper bound for all graphs G without isolated edges: 'g(G)≤ 2((G)+ col(G))-5, where col(G) denotes the coloring number of G. This improves the best known upper bound known previously only for the case of cyclic groups Zk.