@article {
author = {Jeyanthi, P. and Maheswari, A. and Pandiaraj, P.},
title = {One Modulo Three Geometric Mean Graphs},
journal = {Journal of Algorithms and Computation},
volume = {50},
number = {1},
pages = {101-108},
year = {2018},
publisher = {University of Tehran},
issn = {2476-2776},
eissn = {2476-2784},
doi = {10.22059/jac.2018.68342},
abstract = {A graph $G$ is said to be one modulo three geometric mean graph if there is an injective function $\phi$ from the vertex set of $G$ to the set $\{a \mid 1\leq a \leq 3q-2\} $ and either $a\equiv 0(mod 3) $ or $ a\equiv 1(mod 3)\}$ where $q$ is the number of edges of $G$ and $\phi$ induces a bijection $\phi^{*}$ form the edge set of $G$ to $\{a \mid 1\leq a\leq 3q-2 $ and $ a\equiv 1(mod3)\}$ given by $\phi^{*}(uv)=\left\lceil \sqrt{\phi(u)\phi(v)}\right\rceil$ or $\left\lfloor \sqrt{\phi(u)\phi(v)}\right\rfloor$ and the function $\phi$ is called one modulo three geometric mean labeling of $G$. In this paper, we establish that some families of graphs admit one modulo three geometric mean labeling.},
keywords = {mean labeling,one modulo three mean labeling,geometric mean labeling,one modulo three geometric mean labeling,one modulo three geometric mean graph},
url = {https://jac.ut.ac.ir/article_68342.html},
eprint = {https://jac.ut.ac.ir/article_68342_e53cdfd892a4cf9b99d51c533e8902a6.pdf}
}