By Topic

On modular multiplicative divisor graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Revathi, R. ; Dept. of Math., Sathyabama Univ., Chennai, India ; Rajeswari, R.

A graph G (V, E) with /V/ = n is said to have Modular Multiplicative Divisor (MMD) labeling if there exist a bijection f: V(G)→{1, 2, n} and the induced function f*: E(G)→{0, 1, 2, ..., n-1} where f*(uv) = f(u)f(v) mod n such that n divides the sum of all edge labels of G. In this paper we prove that the split graph of cycle Cn, helm graph Hn, flower graph fnX4, cycle cactus C4 (n) and extended triplicate graph of a path Pn (ETG(Pn)) admits Modular Multiplicative Divisor labeling. AMS Subject Classification: 05C78

Published in:

Pattern Recognition, Informatics and Mobile Engineering (PRIME), 2013 International Conference on

Date of Conference:

21-22 Feb. 2013