Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles

\textit{A. Kotzig} and \textit{A. Rosa} [Can. Math. Bull. 13, 451--461 (1970; Zbl 0213.26203)] raised the following question: What is the necessary and sufficient condition for a regular graph of degree 2 (three and four respectively) in order to have an M-valuation? An M-valuation is now called edge-magic total labeling. The authors of this paper show that the union of certain cycles has strong vertex-magic total labelings. Because of this, it is true that the union of a cycle of length \(m\) and \(s\)-copies of triangles possesses a strong vertex-magic total labeling with the exception of a) the union of the cycle on four vertices and a triangle b) the union of the cycle on five vertices and two copies of triangle and c) the union of the cycle on four vertices and 3 copies of a triangle. This aspect very much supports the conjecture of Kotzig that these are the only odd-order 2-regular graphs without strong vertex-magic total labeling. Incidentally, it also supports MacDougall's conjecture concerning which regular graphs possess strong vertex-magic total labelings.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles

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