摘要
利用组合矩阵方法 ,精细地刻画出连通图的最小度与谱半径的上界之间的关系 ,在一定条件下改进了以前的一个结果。
By the means of combinatorial matrix,the relation between minimum degree of connected graph and upper bound of spectral radius was carefully depicted.In some conditions,the previous result was improved.
出处
《河北大学学报(自然科学版)》
CAS
2000年第3期232-234,共3页
Journal of Hebei University(Natural Science Edition)
基金
TheprojectsupportedbyNaturalScienceFoundationofQinghaiProvince(200008)