On Strongly Multiplicative Labeling of Mycielskian Paths and Cycles

Abstract

The strongly multiplicative labeling of a graph G is defined as a labeling from V(G) onto
{1, 2, . . . , p} such that the label induced on the edges by the product of labels of the end vertices are all distinct. In this paper, we investigate the existence of strongly multiplicative labelings of Mycielskian graph of paths and cycles.