z-logo
open-access-imgOpen Access
Magic and Modulo Magicness of Paley Digraph
Publication year - 2019
Publication title -
international journal of recent technology and engineering (ijrte)
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b1354.0982s1119
Subject(s) - tournament , digraph , modulo , combinatorics , mathematics , vertex (graph theory) , prime (order theory) , discrete mathematics , graph
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom