Trimagic Labeling in Digraphs
C. Jayasekaran, M. Regees · Journal of Discrete Mathematical Sciences and Cryptography · 2014
In this paper we introduce (1, 1) indegree vertex trimagic labeling and (1, 1) outdegree vertex trimagic labeling for digraphs. We prove that the directed paths nP2(n ≥ 3), nP4, Pm ⋃ Pn ⋃ Pr directed triangular snake TSn and the directed cycle Cn (n ≥ 3) admit both (1, 1) indegree vertex trimagic labeling and (1, 1) outdegree vertex trimagic labeling. We also prove that the full directed binary tree Tn(n > 3) admit (1, 1) indegree vertex trimagic labeling.