Alan J. Hoffman, The Change in the Least Eigenvalue of the Adjacency Matrix of a Graph Under Imbedding, SIAM Journal on Applied Mathematics, Vol. 17, No. 4 (Jul., 1969), pp. 664-671 ...

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 ...

Technical Terms Graph Algorithms: Methods and procedures for solving problems related to graph structures, including optimisation, connectivity, and flow analysis.