Labelings in Cayley digraphs

Thirusangu, K.; Nagar, Atulya K.; Rajeswari, R.

doi:10.1016/j.ejc.2010.07.006

Cited by 8 publications

(5 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Magic labeling and super vertex (a,d) antimagic labeling for digraphs was introduced by K.Thirusangu et.al. [7]. C. Jayasekaran et.al.…”

Section: Introductionmentioning

confidence: 99%

Magic and Modulo Magicness of Paley Digraph

2019

IJRTE

View full text Add to dashboard Cite

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.

show abstract

“…Magic labeling and super vertex (a,d) antimagic labeling for digraphs was introduced by K.Thirusangu et.al. [7]. C. Jayasekaran et.al.…”

Section: Introductionmentioning

confidence: 99%

Magic and Modulo Magicness of Paley Digraph

2019

IJRTE

View full text Add to dashboard Cite

show abstract

“…The Cayley graph that presents the exact structure of a group and this definition is introduced by Cayley [10]. Thirusangu et al [11] defined labeling concepts for some classes of Cayley digraphs. Further many authors started various labeling technologies on the Cayley digraphs [12], [13].…”

Section: Introductionmentioning

confidence: 99%

Super Edge Graceful and Even Edge Graceful Labeling of Cayley Digraphs

zharasi¹,

jeswari²

2017

IJMTT

View full text Add to dashboard Cite

show abstract

“…The Cayley digraph that visualizes a group in the form of graph is introduced by Cayley [3]. Thirusangu, Atulya and Rajeswari [13] introduced total vertex magic labeling on some classes of Cayley digraphs.…”

Section: Introductionmentioning

confidence: 99%

Graceful and magic labelings on Cayley digraphs

Thamizharasi¹,

Rajeswari²

2015

ijma

Self Cite

View full text Add to dashboard Cite

A digraph G (p,q) is edge odd graceful if there is a bijection f : E(G) → {1,3,5,…,2q-1} such that when each vertex is assigned the sum of the labels of its outgoing arcs mod 2q, the resulting vertex labels are distinct. A digraph G (p,q) is said to be line graceful if the outgoing arcs of every vertex are labeled 0,1,2,…p-1 then the resulting vertex label is the sum of the labels of the outgoing arcs of the vertex modulo p and is distinct for every vertex. Let k ≥ 2. A digraph G(p,q) is called Mod(k)edge magic if there is an edge labeling f: E → {1,2,…,q} such that for each vertex v the sum of the labels of the outgoing arcs of v are equal to the same constant modulo k. In this paper we show that the Cayley digraphs are edge odd graceful, line graceful and mod (k)edge magic.

show abstract

Labelings in Cayley digraphs

Cited by 8 publications

References 2 publications

Magic and Modulo Magicness of Paley Digraph

Magic and Modulo Magicness of Paley Digraph

Super Edge Graceful and Even Edge Graceful Labeling of Cayley Digraphs

Graceful and magic labelings on Cayley digraphs

Contact Info

Product

Resources

About