On estimations for exponents of digraphs using frobenius''s numbers
Sufficient conditions for primitiveness of some su-perconnected digraphs and estimations for exponents of these digraphs are obtained using Frobenius's numbers. It is shown that these estimations are the best in many cases.