摘要
设 G为 n阶简单连通有向图 ,ρ(G)为图 G的邻接谱半径 .本文利用代数方法研究了简单有向图谱半径的性质并给出了ρ(G)的界 .
Let G be a simple connected directed graph wit h n vertices and ρ(G) be the adjacency spectral radius of G . By using algebraic techniques, this paper investigat es some properties of the spectral radius of simple directed graph and presents the boundary of ρ(G) .
出处
《佳木斯大学学报（自然科学版）》
CAS
2003年第3期280-282,共3页
Journal of Jiamusi University：Natural Science Edition
基金
江苏省教育厅自然科学基金资助项目 (0 1KJD110 0 0 5 )
关键词
简单有向图
谱半径
界
邻接矩阵
directed graph
adjacency matrix
spectral radius
