Showing papers on "Spectral graph theory published in 1985"
TL;DR: Recent applications of network-theoretic graph theory to the analysis of certain discretizations of fluid flow are described and a computation of a sparseness matrix previously inaccessible due to lack of a general basis method is described.
Abstract: We describe recent applications of network-theoretic graph theory to the analysis of certain discretizations of fluid flow. Also given are a natural extension to elliptic equations of divergence form and a computation of a sparseness matrix previously inaccessible due to lack of a general basis method.
22 citations
TL;DR: In this paper, the technique of describing the characteristic polynomial of a graph is extended to construction of the eigenvectors, which are expressed as linear functions of Chebyshev polynomials in order to simplify the computational effort.
Abstract: The technique of describing the characteristic polynomial of a graph is here extended to construction of the eigenvectors. Recurrence relations and path tracing are combined to generate eigenvector coefficients as polynomial functions of the eigenvalues. The polynomials are expressed as linear functions of Chebyshev polynomials in order to simplify the computational effort. Particular applications to the Huckel MO theory, including heteroatom effects, are shown.
16 citations