Research Article

DOI:
http://dx.doi.org/10.24327/ijrsr.2019.1005.3441
Subject:
science
KeyWords:
Labeling, multiplicative labeling, strongly multiplicative labeling, minimization of multiplicative labeling and maximization of multiplicative labeling
Abstract:
A graph G =(V,E) with p vertices and q edges is said to be a square multiplicative labeling, if there exists a bijection f :V(G) {1,2,....., p} such that the induced function such that the induced function f :E (G) N is given by f(uv)=f(u)2*f(V) 2for every uvÎ E(G) are all distinct. A graph which admits square multiplicative labeling is called square multiplicative graph. In this paper, we have investigated some families of graphs which admit square multiplicative labeling.