Index of Imprimitivity of the Non-complete Extended P-sum of Digraphs


Milenko_V. Petriæ


We prove that all components of the non-complete extended $p$-sum (NEPS) of strongly connected digraphs have the same index of imprimitivity. This index is given in dependence of the indices of imprimitivity of digraphs on which the operation is performed.