Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21285220201201On strongly 2-multiplicative graphs1791901402810.22049/cco.2020.26647.1127END.D.SomashekaraDepartment of Studies in Mathematics, University of Mysore
Manasagangotri, Mysore-570006, IndiaH.E.RaviDepartment of Studies in Mathematics,
University of Mysore, Manasagangotri, Mysore-570006C.R.VeenaDepartment of Mathematics, JSS College of Arts, Commerce and Science,
Mysore-570025, IndiaJournal Article20190822In 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 graph<br />obtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicativehttp://comb-opt.azaruniv.ac.ir/article_14028_5ef7f3d3936254933ebe84c316170400.pdf