.png){kind=icon}
返回
Graphs for small multiprocessor interconnection networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2010.07.058.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Let D be the diameter of a graph G and let lambda(1) be the largest eigenvalue of its (0, 1)-adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)lambda(1) <= 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to model multiprocessor interconnection networks, especially with respect to the load balancing problem. In addition, we classify integral graphs with small values of (D + 1)lambda(1) in connection with the load balancing problem for multiprocessor systems. (C) 2010 Elsevier Inc. All rights reserved.
Keyword:
Graph theory
Graph spectra
Integral graphs
Diameter
Multiprocessor interconnection networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
.png){kind=icon}
