Open Access

## R. Jeyabalan and G. Kumar

#### Full Text

A graph $G=(V;\; E)$ with {\textit p} vertices and {\textit q} edges is claimed to be strongly vertex multiplicative magic if the vertices of $G$ can be marked from $\{1,\;2,\dots, k\}$ in which no two neighboring vertices gets same label such that labels give raise to the edges obtained by the product of the labels of its end vertices are same. Right now, we show that the existence and non-existence for some families of graphs.

Keywords:
Strongly multiplicative, Strongly vertex multiplicative magic.