MMD labeling of complete tripartite graphs | Zendy

R. Revathi | Zendy; D. Angel | Zendy; R. Mary Jeya Jothi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

MMD labeling of complete tripartite graphs

Author(s) -

R. Revathi,

D. Angel,

R. Mary Jeya Jothi

Publication year - 2021

Publication title -

journal of physics conference series

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.21

H-Index - 85

eISSN - 1742-6596

pISSN - 1742-6588

DOI - 10.1088/1742-6596/1770/1/012083

Subject(s) - combinatorics , edge graceful labeling , multiplicative function , mathematics , graph labeling , modulo , undirected graph , graph , discrete mathematics , graph power , line graph , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research