English

Pertfect matching and zero-sum 3-magic labeling

Combinatorics 2020-10-13 v2

Abstract

A mapping l:E(G)Al : E(G) \rightarrow A, where AA is an abelian group which written additively, is called a labeling of the graph GG. For every positive integer h2h \geqslant 2, a graph GG is said to be zero-sum hh-magic if there is an edge labeling ll from E(G)E(G) into Zh\{0}\mathbb{Z}_{h} \backslash \{0\} such that s(v)=uvE(G)l(uv)=0s(v) = \sum_{uv\in E(G)}l(uv) = 0 for every vertex vV(G)v \in V(G). In 2014, Saieed Akbari, Farhad Rahmati and Sanaz Zare conjectured that every 5-regular graph admits a zero-sum 33-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.

Keywords

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

R2 v1 2026-06-23T15:45:50.239Z