Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
Volume - 13 | Issue-1
A graph G(V, E) with vertex set V is said to have a prime labeling if there exist a bijective function f : V (G) → 1, 2, ..., |V | such that for each edge xy ∈ E(G), gcd(f (x), f (y)) = 1. In this paper, we introduce vertex k-prime labeling of a graph G and exhibit the existence of such a labeling by discussion through various cases.