A-cordial graphs (Q1182892): Difference between revisions

Let \(A\) be an Abelian group. A labelling of a graph \(G=(V,E)\) is any mapping \(f:V\to A\). Every such mapping induces a mapping \(f_ E:E\to A\) by \(f_ E(xy):=f(x)+f(y)\) for \(xy\in E\). A graph is called \(A\)-cordial if there is some labelling \(f\) such that \(\| f^{-1}(a)| -| f^{-1}(b)\|\leq 1\) and \(\| f_ E^{-1}(a)| -| f_ E^{-1}(b)\|\leq 1\) for all \(a,b\in A\). This is a generalization of the notions of harmonious (i.e. \({\mathcal Z}_{| E|}\)-cordial) or cordial (i.e. \({\mathcal Z}_ 2\)-cordial) graphs. It has been conjectured by \textit{R. L. Graham} and \textit{N. J. A. Sloane} [SIAM J. Algebraic Discrete Methods 1, 382-404 (1980; Zbl 0499.05049)] that every tree \(T=(V,E)\) is \({\mathcal Z}_{| E|}\)-cordial. In this paper it is shown that every tree is \({\mathcal Z}_ 3\)-, \({\mathcal Z}_ 4\)-, and \({\mathcal Z}_ 5\)-cordial. Several more results and conjectures are given.