On modular multiplicative divisor graphs

Author

Revathi, R. ; Rajeswari, R.

Author_Institution

Dept. of Math., Sathyabama Univ., Chennai, India

fYear

2013

fDate

21-22 Feb. 2013

Firstpage

56

Lastpage

60

Abstract

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 C_n, helm graph H_n, flower graph f_nX4, cycle cactus C₄ (n) and extended triplicate graph of a path P_n (ETG(P_n)) admits Modular Multiplicative Divisor labeling. AMS Subject Classification: 05C78

Keywords

graph theory; MMD graph labeling; bijection; cycle cactus; edge label; extended triplicate graph; flower graph; helm graph; induced function; modular multiplicative divisor graph; split graph; Educational institutions; Informatics; Labeling; Mobile communication; Pattern recognition; Upper bound; Graph labelin; cycle cactus C4(n); extended triplicate graph of a path (ETG(Pn)); flower graph fn×4; helm graph Hn; path; split graph of cycle Cn;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Conference_Location

Salem

Print_ISBN

978-1-4673-5843-9

Type

conf

DOI

10.1109/ICPRIME.2013.6496447

Filename

6496447