Magic and Modulo Magicness of Paley Digraph

Abstract

A special digraph arises in round robin tournaments. More exactly, a tournament Tq with q players 1, 2, ... , q in which there are no draws. This gives rise to a digraph in which either (u, v) or (v, u) is an arc for each pair u, v. Graham and Spencer defined the tournament as, The nodes of digraph Dp are {0, 1, ... , p -1} and Dp contains the arc (u, v) if and only if u - v is a quadratic residue modulo p where p  3(mod 4) be a prime. This digraph is referred as the Paley tournament. Raymond Paley was a person raised Hadamard matrices by using this quadratic residues. So to honor him this tournament was named as Paley tournament. These results were extended by Bollobas for prime powers. Modular super edge trimagic labeling and modular super vertex magic total labeling has been investigated in this paper.