Now showing items 1-1 of 1
Spanning trees : eigenvalues, special numbers, and the tree-cover ratios, asymptotes and areas of graphs.
This dissertation deals with spanning trees associated with graphs. The number of spanning trees of a graph can be found by considering the eigenvalues of the Laplacian matrix associated with that graph. Special classes ...