Paper Title:Indegree Prime Labeling of Digraphs

Abstract

Let D(p,q)be a digraph. A functionf : V→{1,2,…,p+q} is said to be an indegree prime labeling of D if at each , [ ] ⃗ ⃗⃗⃗ ⃗ In this paper, it is found that whether the digraphs nP2,nP4, ⋃ ⋃ , directed snake and directed cycle admit indegree prime labeling or not. Further, the same is tried for full directed binary tree .


Keywords:Indegree prime labeling