TY - JOUR
ID - 14028
TI - On strongly 2-multiplicative graphs
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Somashekara, D.D.
AU - Ravi, H.E.
AU - Veena, C.R.
AD - Department of Studies in Mathematics, University of Mysore
Manasagangotri, Mysore-570006, India
AD - Department of Studies in Mathematics,
University of Mysore, Manasagangotri, Mysore-570006
AD - Department of Mathematics, JSS College of Arts, Commerce and Science,
Mysore-570025, India
Y1 - 2020
PY - 2020
VL - 5
IS - 2
SP - 179
EP - 190
KW - graph labeling
KW - strongly 2-multiplicative
KW - types of graphs
DO - 10.22049/cco.2020.26647.1127
N2 - 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
UR - http://comb-opt.azaruniv.ac.ir/article_14028.html
L1 - http://comb-opt.azaruniv.ac.ir/article_14028_5ef7f3d3936254933ebe84c316170400.pdf
ER -