Abstract
A simple, connected and undirected graph with n vertices is said to have (MMD) modular multiplicative divisor labeling if there exist a one to one and on to function f from vertices of the graph to set of all natural numbers from 1 to n and label induced on the edges by the product of labels of end vertices modulo n such that addition of all edge labels is congruent to 0 (mod n). This paper studies MMD labeling of complete tripartite graphs and some open problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
