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

Well, if I remember my graph theory well enough, if A is the adjacency matrix of the graph, each entry of A^n is the number of ways to get between the corresponding nodes in n steps or less. So ...

In this thesis, we study sampling and weighted counting of bipartite matchings and directed acyclic graphs (DAGs). The total weight of perfect matchings of a bipartite graph equals the permanent of ...