A Performance on MMD Graphs
R. Revathi1, R. Mary Jeya Jothi2
1R. Revathi, Sathyabama Institute of Science and Technology, Chennai (Tamil Nadu), India.
2R. Mary Jeya Jothi, Sathyabama Institute of Science and Technology, Chennai (Tamil Nadu), India.
Manuscript received on 01 May 2019 | Revised Manuscript received on 15 May 2019 | Manuscript published on 30 May 2019 | PP: 1142-1144 | Volume-8 Issue-7, May 2019 | Retrieval Number: G6343058719/19©BEIESP
Open Access | Ethics and 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 graph G(V,E) with n vertices 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} f:* (uv) = f(u) f(v) (mod n) for all uv ∈ E(G) such that the sum of all edge weights is a multiple of n. This paper studies MMD labeling of larger families of graphs namely, the join of Cn+ with union of 2m disjoint copies of K1 and corona of star Snwith union of 2m disjoint copies of K1.
Keyword: Graph labeling, Corona, Join of two Graphs, MMD labeling, Graph Cn+
Scope of the Article: Measurement & Performance Analysis.