摘要
在组合矩阵论的基础上,利用图论、数论的相关知识和理论以及本原指数、scrambling指数的定义,得到了一类迹非零对称本原有向图的scrambling指数和另一类迹非零对称本原有向图的广义scrambling指数的上界.
On the basis of combinatorial matrix theory,they were proved by using graph theory,number theory and the definitions of the exponent,the scrambling index for primitive digraphs.The scrambling index and the bounds for the generalized scrambling indices are obtained for one class of symmetric primitive digraphs with nonzero trace and the other class.
出处
《中北大学学报(自然科学版)》
CAS
北大核心
2013年第1期17-19,共3页
Journal of North University of China(Natural Science Edition)
基金
国家自然科学基金资助项目(11071227)