Pertfect matching and zero-sum 3-magic labeling

From MaRDI portal
Publication:6341306




Abstract: A mapping l:E(G)ightarrowA, where A is an abelian group which written additively, is called a labeling of the graph G. For every positive integer hgeqslant2, a graph G is said to be zero-sum h-magic if there is an edge labeling l from E(G) into such that s(v)=sumuvinE(G)l(uv)=0 for every vertex vinV(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.











This page was built for publication: Pertfect matching and zero-sum 3-magic labeling

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