Some Results on (Strong) Proper Connection Number of Digraphs

Source abstract

In this paper, we determine the exact values of spc-number of circulant digraphs $Cn([k]),$ which completes the known bounds on them. Next, we prove that the spc-number of strong tournaments is no more than three. Finally, we prove that the pc-number of the digraphs $D$ is equal to the pvc-number of the line digraphs $L(D).$