Group twin coloring of graphs

MaRDI QIDQ4560248zbMATH OpenFDO

Authors Sylwia Cichacz, Jakub Przybyło

Publication date 10 December 2018

Full work available at URL https://arxiv.org/abs/1708.05902, https://dmtcs.episciences.org/4649/pdf

zbMATH Keywords

abelian grouptwin edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: For a given graph $G$, the least integer $kgeq2$ such that for every Abelian group $mathcalG$ of order $k$ there exists a proper edge labeling $f:E(G)ightarrowmathcalG$ so that $su{m}_{xinN(u)}f(xu)eqsu{m}_{xinN(v)}f(xv)$ for each edge $uvinE(G)$ is called the extit{group twin chromatic index} of $G$ and denoted by $chi{\text{'}}_g(G)$. This graph invariant is related to a few well-known problems in the field of neighbor distinguishing graph colorings. We conjecture that $chi{\text{'}}_g(G)leqDelta(G)+3$ for all graphs without isolated edges, where $Delta(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: $chi{\text{'}}_g(G)leq2(Delta(G)+mcol(G))-5$, where $mcol(G)$ denotes the coloring number of $G$. This improves the best known upper bound known previously only for the case of cyclic groups $mathbb{Z}_k$.

Recommendations

• A twin edge coloring conjecture
• On twin edge coloring in trees
• An upper bound for the twin chromatic index of a graph
• On twin edge colorings in \(m\)-ary trees
• On twin edge colorings of graphs

Cited in

(1)

• Group sum chromatic number of graphs

This page was built for publication: Group twin coloring of graphs

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