Magic and Modulo Magicness of Paley Digraph
Parameswari R1, Rajeswari R2
1Parameswari R, Sathyabama Institute of Science and Technology, Deemed to be University, Chennai (Tamil Nadu), India.
2Rajeswari R, Sathyabama Institute of Science and Technology, Deemed to be University, Chennai (Tamil Nadu), India.
Manuscript received on 17 October 2019 | Revised Manuscript received on 25 October 2019 | Manuscript Published on 02 November 2019 | PP: 2850-2852 | Volume-8 Issue-2S11 September 2019 | Retrieval Number: B13540982S1119/2019©BEIESP | DOI: 10.35940/ijrte.B1354.0982S1119
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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. AMS Subject Classification: 05C78.
Keywords: Super Edge Tri Magic Labeling, Paley Digraph and Modular Super Vertex Magic Total Labeling.
Scope of the Article: Cryptography and Applied Mathematics