Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

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.

Keywords

Prime labeling, Edge-prime labeling, Semi-Edge-prime labeling, Bipartite graphs, Tripartite graphs

Publication Date

9-2017

Source Publication Title

Iranian Journal of Mathematical Sciences and Informatics

Volume

12

Issue

1

Start Page

1

End Page

14

Publisher

Academic Center for Education, Culture and Research TMU

Peer Reviewed

1

Copyright

© 2017 Academic Center for Education, Culture and Research TMU

DOI

10.7508/ijmsi.2017.2.001

Link to Publisher's Edition

http://dx.doi.org/10.7508/ijmsi.2017.2.001

ISSN (print)

17354463

ISSN (electronic)

20089473

Included in

Mathematics Commons

Share

COinS