• K. Palani
• A. Catherine
• G. Suganya

Let D(p,q) be a digraph. A function f : V→{1,2,…,p+q} is said to be an outdegree prime pair labeling of D, if at each u ∈ V(D), gcd ⁡[ f(v),f(w)] = 1 ,∀ v,w ∈ N⁺(u), where N⁺(u) = { w ∈ V(D) | uw ∈ A(D)}. In this paper, we tried for outdegree prime pair labeling of some digraphs obtained by orienting the graphs such as Wheel Wn, Book With Triangular Page B₃ⁿ, Double Triangular Snake D(Tn) and Directed Triangular snake TSn.

Outdegree prime pair labeling

"Outdegree Prime Pair Labeling Of Directed Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 1, page no.442-448, January-2019, Available :http://www.jetir.org/papers/JETIR1901A55.pdf

"Outdegree Prime Pair Labeling Of Directed Graphs", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 1, page no. pp442-448, January-2019, Available at : http://www.jetir.org/papers/JETIR1901A55.pdf