On strongly 2-multiplicative graphs

Document Type: Original paper

Authors

1 Department of Studies in Mathematics, University of Mysore Manasagangotri, Mysore-570006, India

2 Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore-570006

3 Department of Mathematics, JSS College of Arts, Commerce and Science, Mysore-570025, India

10.22049/cco.2020.26647.1127

Abstract

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 graph
obtained by duplicating all vertices by new edges in a path and some other graphs are strongly 2 multiplicative

Keywords

Main Subjects