Abstract
Let G= (V,E) be a (p,q)-graph. A bijection f: E → to{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) =Σuw ∈Ef(uw). Moreover, a bijection f: E → {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.
Original language | English |
---|---|
Pages (from-to) | 1-14 |
Number of pages | 14 |
Journal | Iranian Journal of Mathematical Sciences and Informatics |
Volume | 12 |
Issue number | 2 |
DOIs | |
Publication status | Published - Sept 2017 |
Scopus Subject Areas
- General Mathematics
User-Defined Keywords
- Bipartite graphs
- Edge-prime labeling
- Prime labeling
- Semi-Edge-prime labeling
- Tripartite graphs