复杂网络中二部图的Estrada指标

Estrada Indices of Bipartite Graphs in Complex Networks

根据有关图的Estrada指标的理论及相关性质,本文主要运用代数图论和在复杂网络中的已有研究成果,分析计算出图的Estrada指标以及二部图中Estrada指标更为精确的上、下界。为复杂网络各节点之间联系的进一步深入研究提供理论基础。

According to the theory and properties of Estrada indices of graphs, this paper analyzes and calculates Estrada indices of graphs and more accurate upper and lower bounds of Estrada indices of bipartite graphs by using algebraic graph theory and existing research results in complex networks. It provides a theoretical basis for further indepth study of the connections between nodes in complex networks.