The Minimal Vertex Exponent Set of Primitive Digraphs with Girth 2
Xiao Chen · Acta Scientiarum Naturalium Universitatis Sunyatseni · 2000
This paper discusses the minimal vertex exponent set for the class of primitive digraph. It proves that the minimal vertex exponent set of primitive digraphs of order n with girth 2 is E n that E n={2,3,…,2n-3} if n is odd and E n={2,3,…2n-4} if n is even.