A New Upper Bound on the Spectral Radius of Graphs
DOI:
CSTR:
Author:
Affiliation:
Clc Number:
O157.5
Fund Project:
Article
|
Figures
|
Metrics
|
Reference
|
Related
|
Cited by
|
Materials
|
Comments
Abstract:
based ou previous results,A new upper bound on the spectral radius of graphs has been gotten by us,and what the giving examples shows is that the new upper bound is better in some situations.
Reference
Related
Cited by
Get Citation
黎新华; 莫辉辉. ACO算法及其收敛策略研究进展[J].华东交通大学学报,2007,24(1):155-158. . A New Upper Bound on the Spectral Radius of Graphs[J]. JOURNAL OF EAST CHINA JIAOTONG UNIVERSTTY,2007,24(1):155-158
