On (Semi-) edge-primality of graphs

Wai Chee SHIU, Gee Choon Lau*, Sin Min Lee

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)1-14
Number of pages14
JournalIranian Journal of Mathematical Sciences and Informatics
Volume12
Issue number2
DOIs
Publication statusPublished - Sep 2017

Scopus Subject Areas

  • Mathematics(all)

User-Defined Keywords

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

Fingerprint

Dive into the research topics of 'On (Semi-) edge-primality of graphs'. Together they form a unique fingerprint.

Cite this