@ARTICLE{Lau,
author = {Shiu, W.-C. and Lau, G.-C. and Lee, S.-M. and },
title = {On (Semi-) Edge-primality of Graphs},
volume = {12},
number = {2},
abstract ={Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an edge-prime (or a semi-edge-prime) labeling is called an edge-prime (or a semi-edge-prime) graph. In this paper we determine the necessary and/or sufficient condition for the existence of (semi-) edge-primality of many family of graphs. },
URL = {http://ijmsi.ir/article-1-924-en.html},
eprint = {http://ijmsi.ir/article-1-924-en.pdf},
journal = {Iranian Journal of Mathematical Sciences and Informatics},
doi = {10.7508/ijmsi.2017.2.001},
year = {2017}
}