Showing papers on "Spectral graph theory published in 1983"
TL;DR: It has been shown how this concept can be efficiently utilized to compute the characteristic polynomial of a graph and the corresponding eigenvalues and the eigenvectors of the graph.
Abstract: A new concept, ‘ path polynomial ’ of a graph, has been introduced in this paper and it has been shown how this concept can be efficiently utilized to compute the characteristic polynomial of a graph and the corresponding eigenvalues and the eigenvectors of the graph. Some results have also been developed to compute directly the eigen values and eigenvectors of some special families of graphs from the knowledge of the eigenvalues and eigenvectors of smaller subgraphs.
1 citations