Strongly Multiplicative Labeling in the Context of Arbitrary Supersubdivision

S K Vaidya, N A Dani, P L Vihol, K K Kanani


We investigate some new results for strongly multiplicative labeling of graph. We prove that the graph obtained by arbitrary supersubdivision of tree $T$, grid graph $P_{n}\times P_{m}$, complete bipartite graph $K_{m,n}$, $C_{n}\odot P_{m}$ and one-point union of $m$ cycle of length $n$ are strongly multiplicative.

Full Text:



Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.