【摘要】 本文用数论方法探讨极小强连通本原有向图的本原指数问题,证明了e(n)≥9[n/4]~2-23[n/4]+21,从而获得了e(n)的一个9/16n~2级的下界。更多还原

【Abstract】 In this paper, we use the number theoretical method to discuss the problem of the exponents of primitive, ministrong digraphs in graph theory, and prove that e(n)≥9[n/4]~2-23[n/4]+21,so that we get a lower bound for e(n) of order 9/16 n~2更多还原