Abstract:
Sufficient conditions for primitiveness of some superconnected 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.
Keywords:Frobenius's number, primitive graph, exponent of graph.