Pertfect matching and zero-sum 3-magic labeling
Abstract
A mapping l : E(G) → A, where A is an abelian group which written additively, is called a labeling of the graph G. For every positive integer h ≥slant 2, a graph G is said to be zero-sum h-magic if there is an edge labeling l from E(G) into Zh \0\ such that s(v) = Σuv∈ E(G)l(uv) = 0 for every vertex v ∈ V(G). In 2014, Saieed Akbari, Farhad Rahmati and Sanaz Zare conjectured that every 5-regular graph admits a zero-sum 3-magic labeling. In this paper, we obtained that every 5-regular graph with every edge contains in a triangle must have a perfect matching, and admits a zero-sum 3-magic labeling, which partially confirms this conjecture.
0