Network analysis begins with data that describes the set of relationships among the members of a system. The goal of analysis is to obtain from the low-level relational data a higher-level description ...

Let G be a graph, A(G) be the adjacency matrix of G, and λ(G) the least eigenvalue of A(G). Information is given about the following three quantities: $\lambda_R(G ...

The eigenvalue of a graph is the eigenvalue of its adjacency matrix. A graph G is integral if all of its eigenvalues are integers. In this paper some new classes of integral graphs are constructed.

A plot of the rescaled eigenvalue spectrum of horizontal visibility graphs in the Feigenbaum scenario. (Courtesy: J. Phys. A: Math. Theor. 10.1088/1751-8121/ab587f) By means of the so-called ...