%0 Journal Article
%T On strongly 2-multiplicative graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A Somashekara, D.D.
%A Ravi, H.E.
%A Veena, C.R.
%D 2020
%\ 12/01/2020
%V 5
%N 2
%P 179-190
%! On strongly 2-multiplicative graphs
%K graph labeling
%K strongly 2-multiplicative
%K types of graphs
%R 10.22049/cco.2020.26647.1127
%X In this paper we obtain an upper bound and also a lower bound for maximum edges of strongly 2 multiplicative graphs of order n. Also we prove that triangular ladder the graph obtained by duplication of an arbitrary edge by a new vertex in path and the graphobtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative
%U http://comb-opt.azaruniv.ac.ir/article_14028_5ef7f3d3936254933ebe84c316170400.pdf