@article {
author = {Yoong, Kooi-Kuan and Hasni, Roslan and Lau, Gee-Choon and Ahmad, Ali},
title = {On the vertex irregular reflexive labeling of generalized friendship graph and corona product of graphs},
journal = {Communications in Combinatorics and Optimization},
volume = {9},
number = {3},
pages = {509-526},
year = {2024},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2023.28046.1426},
abstract = {For a graph $G$, we define a total $k$-labeling $\varphi$ as a combination of an edge labeling $\varphi_e:E(G)\rightarrow \{1,\,2,\,\ldots,\,k_e\}$ and a vertex labeling $\varphi_v:V(G)\rightarrow \{0,\,2,\,\ldots,\,2k_v\}$, where $k=\,\mbox{max}\, \{k_e,2k_v\}$. The total $k$-labeling $\varphi$ is called a vertex irregular reflexive $k$-labeling of $G$ if any pair of vertices $u$, $u'$ have distinct vertex weights $wt_{\varphi}(u)\neq wt_{\varphi}(u')$, where $wt_{\varphi}(u)=\varphi(u)+\sum_{uu'\in E(G)} \varphi(uu')$ for any vertex $u\in V(G)$. The smallest value of $k$ for which such a labeling exists is called the reflexive vertex strength of $G$, denoted by $rvs{(G)}$. In this paper, we present a new lower bound for the reflexive vertex strength of any graph. We investigate the exact values of the reflexive vertex strength of generalized friendship graphs, corona product of two paths, and corona product of a cycle with isolated vertices by referring to the lower bound. This study discovers some interesting open problems that are worth further exploration.},
keywords = {Vertex irregular reflexive labeling,Reflexive vertex strength,Generalized friendship graph,Corona product},
url = {http://comb-opt.azaruniv.ac.ir/article_14545.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_14545_827f4576ec34ec69917d00d963659911.pdf}
}