On Strongly Multiplicative Graphs
M. Muthusamy, Jayapal Baskar Babujee · 2012
A graph G with p vertices and q edges is said to be strongly multiplicative if the vertices are assigned distinct numbers 1, 2, 3, …, p such that the labels induced on the edges by the product of the end vertices are distinct. We prove some of the special graphs obtained through graph operations such as Cn + (a graph obtained by adding pendent edge for each vertex of the cycle Cn), (Pn mK1) +N2, Pn + mK1 and Cn d (cycle Cn with non-intersecting chords) are strongly multiplicative.