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 ...
We investigate the rank of the adjacency matrix of large diluted random graphs: for a sequence of graphs (G n ) n≥0 converging locally to a Galton—Watson tree T (GWT), we provide an explicit formula ...
PROC MODEL provides several features to aid in analyzing the structure of the model program. These features summarize properties of the model in various forms. The following Klein's model program is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback