论文部分内容阅读
This paper constructs a new spectrum of networks by means of the matrix of link-state of the network, which can reveal the characteristics of the correlation between the degrees of the network. Also, the computation of this spectrum of networks is usually more feasible and more efficient due to the much lower order of its matrix of link-state than its adjacent matrix in practice. Some estimates for the bounds of the key eigenvalues in the spectrum are obtained, the corresponding inequalities are presented and proved. For the sake of its application, the authors define spectrum of networks in two ways, and all theorems are given in parallel for both kinds of definition. In addition, the authors find a symmetry in the spectrum, which is relative to the characteristic of structure of its network to some extent.