@article {
author = {Somashekara, D.D. and Ravi, H.E. and Veena, C.R.},
title = {On strongly 2-multiplicative graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {5},
number = {2},
pages = {179-190},
year = {2020},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2020.26647.1127},
abstract = {A simple connected graph $G$ of order $n\ge 3$ is a strongly 2-multiplicative if there is an injective mapping $f:V(G)\rightarrow \{1,2,\ldots,n\}$ such that the induced mapping $h:\mathcal{A} \rightarrow \mathbb{Z}^+$ defined by $h(\mathcal{P})= \prod_{i=1}^{3} f({v_j}_i)$, where $j_1,j_2,j_{3}\in \{1,2,\ldots,n\}$, and $\mathcal{P}$ is the path homotopy class of paths having the vertex set $\{ v_{j_1}, v_{j_2},v_{j_{3}} \}$, is injective. Let $\Lambda(n)$ be the number of distinct path homotopy classes in a strongly 2-multiplicative graph of order $n$. In this paper we obtain an upper bound and also a lower bound for $\Lambda(n)$. Also we prove that triangular ladder, $P_{2} \bigodot C_{n}$, $P_{m}\bigodot P_{n}$, the graph obtained by duplication of an arbitrary edge by a new vertex in path $P_{n}$ and the graph obtained by duplicating all vertices by new edges in a path $P_{n}$ are strongly 2-multiplicative. },
keywords = {graph labeling,strongly 2-multiplicative,types of graphs},
url = {http://comb-opt.azaruniv.ac.ir/article_14028.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_14028_5ef7f3d3936254933ebe84c316170400.pdf}
}