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 ...
One noticeable effect of the recession is the way companies are developing strategy and innovation on the fly. Anyone in any doubt that old strategy is dying should take a look around at what ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback