Pertfect matching and zero-sum 3-magic labeling
Combinatorics
2020-10-13 v2
Abstract
A mapping , where is an abelian group which written additively, is called a labeling of the graph . For every positive integer , a graph is said to be zero-sum -magic if there is an edge labeling from into such that for every vertex . In 2014, Saieed Akbari, Farhad Rahmati and Sanaz Zare conjectured that every 5-regular graph admits a zero-sum -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.
Cite
@article{arxiv.2005.11648,
title = {Pertfect matching and zero-sum 3-magic labeling},
author = {Haobai Wang},
journal= {arXiv preprint arXiv:2005.11648},
year = {2020}
}
Comments
Unreadable and need to be modified